The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A112961 a(n) = a(n-1)^3 + a(n-2)^3 for n >= 2 with a(0) = 0, a(1) = 1. 7
0, 1, 1, 2, 9, 737, 400316282, 64151935432803278787493321, 264015418305763603932856608512044494366944180663171458205345412119783805892929 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
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
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.
MAPLE
a:= proc(n) a(n):= `if`(n<2, n, a(n-1)^3+a(n-2)^3) end:
seq(a(n), n=0..8); # Alois P. Heinz, Sep 02 2023
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
Sequence in context: A208225 A208228 A262089 * A114953 A252583 A253604
KEYWORD
easy,nonn
AUTHOR
Jonathan Vos Post, Jan 02 2006
EXTENSIONS
Name edited by Petros Hadjicostas, Nov 03 2019
a(0)=0 prepended by Alois P. Heinz, Sep 02 2023
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 27 16:21 EDT 2024. Contains 372880 sequences. (Running on oeis4.)