cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A153976 #22 Sep 08 2022 08:45:40
%S A153976 8,28,72,152,280,468,728,1072,1512,2060,2728,3528,4472,5572,6840,8288,
%T A153976 9928,11772,13832,16120,18648,21428,24472,27792,31400,35308,39528,
%U A153976 44072,48952,54180,59768,65728,72072,78812,85960,93528,101528,109972,118872,128240
%N A153976 a(n) = n^3 + (n+2)^3.
%H A153976 Vincenzo Librandi, <a href="/A153976/b153976.txt">Table of n, a(n) for n = 0..765</a>
%H A153976 <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (4,-6,4,-1).
%F A153976 For n>3, a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4). - _Harvey P. Dale_, Aug 02 2011
%F A153976 G.f.: 4*( 2-x+2*x^2 ) / (x-1)^4 . - _R. J. Mathar_, Apr 11 2016
%F A153976 a(n) = 4*A229183(n+1). - _R. J. Mathar_, Apr 11 2016
%t A153976 f[n_]:=n^3;lst={};Do[AppendTo[lst,(f[n]+f[n+2])],{n,0,6!}];lst
%t A153976 Array[#^3+(#+2)^3&,40,0] (* or *) LinearRecurrence[{4,-6,4,-1},{8,28,72,152},40] (* _Harvey P. Dale_, Aug 02 2011 *)
%o A153976 (Magma) [n^3+(n+2)^3: n in [0..60]]; // _Vincenzo Librandi_, Apr 26 2011
%o A153976 (Python)
%o A153976 def a(n): return n**3 + (n+2)**3
%o A153976 print([a(n) for n in range(40)]) # _Michael S. Branicky_, Aug 28 2021
%Y A153976 Cf. A000537, A000578, A003215, A005898, A006007, A027602.
%K A153976 nonn,easy
%O A153976 0,1
%A A153976 _Vladimir Joseph Stephan Orlovsky_, Jan 03 2009
%E A153976 Offset changed from 1 to 0 by _Vincenzo Librandi_, Apr 26 2011