|
|
A000283
|
|
a(n) = a(n-1)^2 + a(n-2)^2 for n >= 2 with a(0) = 0 and a(1) = 1.
|
|
27
|
|
|
0, 1, 1, 2, 5, 29, 866, 750797, 563696885165, 317754178345286893212434, 100967717855888389973004846476977145423449281581
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,4
|
|
LINKS
|
|
|
FORMULA
|
a(0)=0; for n >= 1, a(n) = floor(A^(2^(n-1))), where A=1.2353927377854368896\ 22331013228440824347457186913679454733601897236639743839118542826528455451978134... - Benoit Cloitre, May 03 2003
|
|
MAPLE
|
|
|
MATHEMATICA
|
RecurrenceTable[{a[n + 2] == a[n + 1]^2 + a[n]^2, a[0] == 0, a[1] == 1}, a, {n, 0, 12}] (* Emanuele Munarini, Mar 30 2017 *)
|
|
PROG
|
(PARI) {a(n) = if( n<2, n>0, a(n-1)^2 + a(n-2)^2)}; /* Michael Somos, Feb 10 2002 */
(Maxima) a(n) := if n=0 then 0 elseif n=1 then 1 else a(n-1)^2 + a(n-2)^2;
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Stephen J. Greenfield (greenfie(AT)math.rutgers.edu)
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|