cp's OEIS Frontend

A112961 a(n) = a(n-1)^3 + a(n-2)^3 for n >= 2 with a(0) = 0, a(1) = 1.

%I A112961 #21 Sep 15 2023 12:00:11
%S A112961 0,1,1,2,9,737,400316282,64151935432803278787493321,
%T A112961 264015418305763603932856608512044494366944180663171458205345412119783805892929
%N A112961 a(n) = a(n-1)^3 + a(n-2)^3 for n >= 2 with a(0) = 0, a(1) = 1.
%C A112961 A cubic Fibonacci sequence.
%C A112961 This is the cubic analog of the Fibonacci sequence analogously to A000283 being the quadratic analog of the Fibonacci sequence.
%F A112961 a(n) ~ b^3^n with b = 1.0275436477.... [_Charles R Greathouse IV_, Dec 28 2011]
%e A112961 a(3) = 1^3 + 1^3 = 2.
%e A112961 a(4) = 1^3 + 2^3 = 9.
%e A112961 a(5) = 2^3 + 9^3 = 737.
%e A112961 a(6) = 9^3 + 737^3 = 400316282.
%p A112961 a:= proc(n) a(n):= `if`(n<2, n, a(n-1)^3+a(n-2)^3) end:
%p A112961 seq(a(n), n=0..8);  # _Alois P. Heinz_, Sep 02 2023
%t A112961 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 *)
%Y A112961 Cf. A000045, A000283.
%K A112961 easy,nonn
%O A112961 0,4
%A A112961 _Jonathan Vos Post_, Jan 02 2006
%E A112961 Name edited by _Petros Hadjicostas_, Nov 03 2019
%E A112961 a(0)=0 prepended by _Alois P. Heinz_, Sep 02 2023