This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A182425 #11 Apr 29 2012 14:00:18
%S A182425 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 A182425 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 A182425 0,0,0,0,0,0,0,0,1,1,0,0,1,2,0,0,0,0,0
%N A182425 a(n) the largest integer K such that (prime(n+1)-1)^(2^k)+1 for 0<=k<=K is prime.
%C A182425 This sequence is a generalized reference to Fermat primes.
%t A182425 Table[k = 0; While[PrimeQ[(Prime[n+1] - 1)^(2^k) + 1], k++]; k - 1, {n, 100}] (* _T. D. Noe_, Apr 28 2012 *)
%Y A182425 Cf. A182199.
%K A182425 nonn
%O A182425 1,1
%A A182425 _Thomas Ordowski_, Apr 28 2012