login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A105850 a(n+1) = a(n)^2 - 2^(2^n+1) with a(1) = 8. 0
8, 56, 3104, 9634304, 92819813433344, 8615517765800787268541087744, 74227146372828989101844394431169040459931374583287906304 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Lehmer used this sequence in his proof of the Lucas-Lehmer test.
LINKS
D. H. Lehmer, On Lucas's Test for the Primality of Mersenne's Numbers, J. London Math. Soc., 10 (1935) 162-165.
FORMULA
a(n) = 2^(2^(n-1))*A003010(n).
MATHEMATICA
nxt[{n_, a_}]:={n+1, a^2-2^(2^n+1)}; Transpose[NestList[nxt, {1, 8}, 7]][[2]] (* Harvey P. Dale, Jul 24 2013 *)
CROSSREFS
Cf. A003010.
Sequence in context: A133671 A326239 A154411 * A009089 A296466 A202863
KEYWORD
nonn
AUTHOR
Douglas Stones (dssto1(AT)student.monash.edu.au), Apr 22 2005
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 14 12:56 EDT 2024. Contains 374318 sequences. (Running on oeis4.)