|
Search: id:A000283
|
|
|
| A000283 |
|
a(n) = a(n-1)^2 + a(n-2)^2. |
|
+0
23
|
|
| 0, 1, 1, 2, 5, 29, 866, 750797, 563696885165, 317754178345286893212434, 100967717855888389973004846476977145423449281581
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
FORMULA
|
a(0)=0 for n>=1 a(n)=floor(A^(2^(n-1))) where A=1.235392737785436889622331013228440824347457186913679454733601897236639743839118542826528455451978134... - Benoit Cloitre (benoit7848c(AT)orange.fr), May 03 2003
|
|
MAPLE
|
A000283 := proc(n) option remember; if n <= 1 then n else A000283(n-2)^2+A000283(n-1)^2; fi; end;
|
|
PROGRAM
|
(PARI) a(n)=if(n<2, n>0, a(n-1)^2+a(n-2)^2)
|
|
CROSSREFS
|
Cf. A000278.
Adjacent sequences: A000280 A000281 A000282 this_sequence A000284 A000285 A000286
Sequence in context: A064098 A098717 A059784 this_sequence A121910 A073833 A086383
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
greenfie(AT)math.rutgers.edu (Stephen J. Greenfield)
|
|
|
Search completed in 0.002 seconds
|
