%I #11 Apr 29 2012 14:00:18

%S 4,3,2,1,0,2,0,0,0,0,1,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,0,

%T 1,1,0,0,0,0,2,0,0,0,0,2,0,0,0,0,0,1,1,1,0,0,1,0,1,0,0,1,0,0,0,0,0,0,

%U 0,0,0,0,0,0,0,0,1,1,0,0,1,2,0,0,0,0,0

%N a(n) the largest integer K such that (prime(n+1)-1)^(2^k)+1 for 0<=k<=K is prime.

%C This sequence is a generalized reference to Fermat primes.

%t Table[k = 0; While[PrimeQ[(Prime[n+1] - 1)^(2^k) + 1], k++]; k - 1, {n, 100}] (* _T. D. Noe_, Apr 28 2012 *)

%Y Cf. A182199.

%K nonn

%O 1,1

%A _Thomas Ordowski_, Apr 28 2012