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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A112961 a(1) = a(2) = 1; for n>2: a(n) = a(n-1)^3 + a(n-2)^3. 7
1, 1, 2, 9, 737, 400316282, 64151935432803278787493321, 264015418305763603932856608512044494366944180663171458205345412119783805892929 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

A cubic Fibonacci sequence.

This is the cubic analog of the Fibonacci sequence analogously to A000283 being the quadratic analog of the Fibonacci sequence.

LINKS

Table of n, a(n) for n=1..8.

FORMULA

a(n) ~ b^3^n with b = 1.0275436477.... [Charles R Greathouse IV, Dec 28 2011]

EXAMPLE

a(3) = 1^3 + 1^3 = 2.

a(4) = 1^3 + 2^3 = 9.

a(5) = 2^3 + 9^3 = 737.

a(6) = 9^3 + 737^3 = 400316282.

MATHEMATICA

RecurrenceTable[{a[1]==a[2]==1, a[n]==a[n-1]^3+a[n-2]^3}, a, {n, 10}] (* Harvey P. Dale, Aug 24 2014 *)

CROSSREFS

Cf. A000045, A000283.

Sequence in context: A208225 A208228 A262089 * A114953 A252583 A253604

Adjacent sequences:  A112958 A112959 A112960 * A112962 A112963 A112964

KEYWORD

easy,nonn

AUTHOR

Jonathan Vos Post, Jan 02 2006

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 21 16:14 EDT 2019. Contains 328302 sequences. (Running on oeis4.)