|
%I #25 Jan 31 2017 01:28:00
%S 0,1,1,2,3,11,38,1369,56241,2565782650,177895665388171,
%T 16891164530321501264425013171,
%U 5629840598310484749297545401724540333537382
%N a(n) = a(n-1) + a(n-2)^3.
%C Next term has 85 digits. - _Harvey P. Dale_, Jun 20 2011
%H T. D. Noe, <a href="/A000280/b000280.txt">Table of n, a(n) for n = 0..17</a>
%F a(n) ~ c^(3^(n/2)), where c = 1.14457078346212152491547554986213352458144397286642473397... if n is even and c = 1.16698926092791545640507670257893418561351605568060984739... if n is odd. - _Vaclav Kotesovec_, Feb 26 2016
%p A000280 := proc(n) option remember; if n <= 1 then n else A000280(n-2)^3+A000280(n-1); fi; end;
%p a[ -2]:=0: a[ -1]:=1:a[0]:=1: a[1]:=2: for n from 2 to 10 do a[n]:=a[n-1]+a[n-2]^3 od: seq(a[n], n=-2..10); # _Zerinvary Lajos_, Mar 19 2009
%t RecurrenceTable[{a[0]==0,a[1]==1,a[n]==a[n-1]+a[n-2]^3},a,{n,15}] (* _Harvey P. Dale_, Jun 20 2011 *)
%Y Cf. A000278.
%K nonn
%O 0,4
%A Stephen J. Greenfield (greenfie(AT)math.rutgers.edu)
%E Mathematica program fixed by _Vaclav Kotesovec_, Feb 26 2016
| 