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 A105850 #12 Jul 24 2013 18:55:24
%S A105850 8,56,3104,9634304,92819813433344,8615517765800787268541087744,
%T A105850 74227146372828989101844394431169040459931374583287906304
%N A105850 a(n+1) = a(n)^2 - 2^(2^n+1) with a(1) = 8.
%C A105850 Lehmer used this sequence in his proof of the Lucas-Lehmer test.
%H A105850 D. H. Lehmer, <a href="http://www.utm.edu/research/primes/mersenne/LukeMirror/lit/lit_007s.htm">On Lucas's Test for the Primality of Mersenne's Numbers</a>, J. London Math. Soc., 10 (1935) 162-165.
%F A105850 a(n) = 2^(2^(n-1))*A003010(n).
%t A105850 nxt[{n_,a_}]:={n+1,a^2-2^(2^n+1)}; Transpose[NestList[nxt,{1,8},7]][[2]] (* _Harvey P. Dale_, Jul 24 2013 *)
%Y A105850 Cf. A003010.
%K A105850 nonn
%O A105850 1,1
%A A105850 Douglas Stones (dssto1(AT)student.monash.edu.au), Apr 22 2005