login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A000280 a(n) = a(n-1) + a(n-2)^3. 1
0, 1, 1, 2, 3, 11, 38, 1369, 56241, 2565782650, 177895665388171, 16891164530321501264425013171, 5629840598310484749297545401724540333537382 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

COMMENTS

Next term has 85 digits. - Harvey P. Dale, Jun 20 2011

LINKS

T. D. Noe, Table of n, a(n) for n = 0..17

FORMULA

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

MAPLE

A000280 := proc(n) option remember; if n <= 1 then n else A000280(n-2)^3+A000280(n-1); fi; end;

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

MATHEMATICA

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 *)

CROSSREFS

Cf. A000278.

Sequence in context: A088747 A231574 A007756 * A249402 A046224 A081173

Adjacent sequences:  A000277 A000278 A000279 * A000281 A000282 A000283

KEYWORD

nonn

AUTHOR

Stephen J. Greenfield (greenfie(AT)math.rutgers.edu)

EXTENSIONS

Mathematica program fixed by Vaclav Kotesovec, Feb 26 2016

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified November 21 22:32 EST 2017. Contains 295054 sequences.