cp's OEIS Frontend

A215097 a(n) = n^3 - a(n-2) for n >= 2 and a(0)=0, a(1)=1.

%I A215097 #37 May 03 2021 09:52:05
%S A215097 0,1,8,26,56,99,160,244,352,485,648,846,1080,1351,1664,2024,2432,2889,
%T A215097 3400,3970,4600,5291,6048,6876,7776,8749,9800,10934,12152,13455,14848,
%U A215097 16336,17920,19601,21384,23274,25272,27379,29600,31940,34400,36981,39688,42526
%N A215097 a(n) = n^3 - a(n-2) for n >= 2 and a(0)=0, a(1)=1.
%H A215097 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (4,-7,8,-7,4,-1).
%F A215097 G.f.: (x+4*x^2+x^3)/((-1+x)^4*(1+x^2)). - _David Scambler_, Aug 06 2012
%F A215097 a(n) = (n*(n^2-3)-(1-(-1)^n)*i^(n+1))/2, where i=sqrt(-1). - _Bruno Berselli_, Aug 07 2012
%t A215097 RecurrenceTable[{a[0] == 0, a[1] == 1, a[n] == n^3 - a[n - 2]}, a[n], {n, 0, 43}] (* _Bruno Berselli_, Aug 07 2012 *)
%o A215097 (Python)
%o A215097 prpr = 0
%o A215097 prev = 1
%o A215097 for n in range(2,77):
%o A215097     print(prpr, end=',')
%o A215097     curr = n*n*n - prpr
%o A215097     prpr = prev
%o A215097     prev = curr
%Y A215097 Cf. A000217 (n^2 - a(n-1)).
%Y A215097 Cf. A125577 (n^2 - a(n-1) with a(0)=1).
%Y A215097 Cf. A011934 (n^3 - a(n-1)).
%Y A215097 Cf. A153026 (n^3 - a(n-1) with a(1)=0).
%Y A215097 Cf. A194274 (n^2 - a(n-2)).
%Y A215097 Cf. A187093 (n^2 - a(n-2) with a(0)=a(1)=1, a(-1)=0).
%Y A215097 Cf. A107386 ((n-2)^2 - a(n-1) with a(0)=0, a(1)=a(2)=1, a(3)=2).
%Y A215097 Cf. A206481 ((n-1)^3 - a(n-2)).
%K A215097 nonn,easy
%O A215097 0,3
%A A215097 _Alex Ratushnyak_, Aug 03 2012