|
|
A000284
|
|
a(n) = a(n-1)^3 + a(n-2) with a(0)=0, a(1)=1.
|
|
1
|
|
|
|
OFFSET
|
0,4
|
|
LINKS
|
|
|
FORMULA
|
For n>0, a(n) = floor(c^(3^n)) where c=1.0275090796393628012075291021962112731026759143420911102331653107087209649910... - Gerald McGarvey, Nov 28 2007
|
|
MAPLE
|
a[-2]:=0: a[-1]:=1: a[0]:=1: a[1]:=2: for n from 2 to 6 do a[n]:=a[n-1]^3+a[n-2] od: seq(a[n], n=-2..6); # Zerinvary Lajos, Mar 19 2009
|
|
MATHEMATICA
|
RecurrenceTable[{a[n] == a[n-1]^3 + a[n-2], a[0] == 0, a[1] == 1}, a, {n, 0, 8}] (* Jean-François Alcover, Feb 06 2016 *)
nxt[{a_, b_}]:={b, b^3+a}; NestList[nxt, {0, 1}, 9][[All, 1]] (* Harvey P. Dale, May 08 2020 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Stephen J. Greenfield (greenfie(AT)math.rutgers.edu)
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|