cp's OEIS Frontend

A206481 a(n) + a(n+2) = n^3.

%I A206481 #37 Apr 11 2024 16:30:36
%S A206481 0,1,1,7,26,57,99,159,244,353,485,647,846,1081,1351,1663,2024,2433,
%T A206481 2889,3399,3970,4601,5291,6047,6876,7777,8749,9799,10934,12153,13455,
%U A206481 14847,16336,17921,19601,21383,23274,25273,27379,29599,31940,34401,36981,39687
%N A206481 a(n) + a(n+2) = n^3.
%C A206481 If the offset were 0, the formula would be: a(0)=0, a(1)=1, for n>=2: a(n) = (n-1)^3 - a(n-2).
%H A206481 Vincenzo Librandi, <a href="/A206481/b206481.txt">Table of n, a(n) for n = 1..1000</a>
%H A206481 <a href="/index/Rec#order_06">Index entries for linear recurrences with constant coefficients</a>, signature (4,-7,8,-7,4,-1).
%F A206481 a(n) = (1/2)*((n-3)*n^2-4*cos((Pi*n)/2)+2). - _Harvey P. Dale_, Sep 14 2012
%F A206481 G.f.: x^2*(1 - 3*x + 10*x^2 - 3*x^3 + x^4)/((1-x)^4*(1+x^2)). - _Paul D. Hanna_, Sep 14 2012
%t A206481 LinearRecurrence[{4, -7, 8, -7, 4, -1}, {0, 1, 1, 7, 26, 57}, 60]
%t A206481 RecurrenceTable[{a[1]==0,a[2]==1,a[n]==(n-2)^3-a[n-2]},a,{n,50}] (* _Harvey P. Dale_, Sep 14 2012 *)
%o A206481 (Python)
%o A206481 prpr = 0
%o A206481 prev = 1
%o A206481 for n in range(1,77):
%o A206481     print(prpr, end=',')
%o A206481     curr = n*n*n - prpr    # a(n+1)
%o A206481     prpr = prev
%o A206481     prev = curr
%Y A206481 Cf. A144129 (bisection).
%K A206481 nonn,easy
%O A206481 1,4
%A A206481 _Vladimir Joseph Stephan Orlovsky_, Feb 08 2012