|
Search: id:A001042
|
|
|
| A001042 |
|
a(n) = a(n-1)^2 - a(n-2)^2.
(Formerly M0743 N0279)
|
|
+0
3
|
|
| 1, 2, 3, 5, 16, 231, 53105, 2820087664, 7952894429824835871, 63248529811938901240357985099443351745, 4000376523371723941902615329287219027543200136435757892789536976747706216384
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
The next term has 152 digits. - Franklin T. Adams-Watters (FrankTAW(AT)Netscape.net), Jun 11 2009
|
|
REFERENCES
|
Archimedeans Problems Drive, Eureka, 27 (1964), 6.
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
|
|
LINKS
|
A. V. Aho and N. J. A. Sloane, Some doubly exponential sequences, Fib. Quart., 11 (1973), 429-437.
Index entries for sequences of form a(n+1)=a(n)^2 + ...
|
|
CROSSREFS
|
Cf. A001146, A000278, A000283, A058182, A007018.
Sequence in context: A120755 A111183 A048112 this_sequence A045313 A045314 A129943
Adjacent sequences: A001039 A001040 A001041 this_sequence A001043 A001044 A001045
|
|
KEYWORD
|
nonn,nice,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), R. K. Guy
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), Sep 19 2000
|
|
|
Search completed in 0.002 seconds
|
