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!)
A100207 a(n) = 4 + 8*n + 10*n^2 + 4*n^3. 1

%I #15 Apr 01 2024 09:13:35

%S 4,26,92,226,452,794,1276,1922,2756,3802,5084,6626,8452,10586,13052,

%T 15874,19076,22682,26716,31202,36164,41626,47612,54146,61252,68954,

%U 77276,86242,95876,106202,117244,129026,141572,154906,169052,184034,199876,216602,234236

%N a(n) = 4 + 8*n + 10*n^2 + 4*n^3.

%D T. A. Gulliver, Sequences from Cubes of Integers, Int. Math. Journal, 4 (2003), 439-445.

%H Vincenzo Librandi, <a href="/A100207/b100207.txt">Table of n, a(n) for n = 0..2000</a>

%H <a href="/index/Rec#order_04">Index entries for linear recurrences with constant coefficients</a>, signature (4,-6,4,-1).

%F From _G. C. Greubel_, Apr 01 2024: (Start)

%F a(n) = 2*(2*(n + 1)^3 - (n + 1)^2 + 1).

%F G.f.: 2*(2 + 5*x + 6*x^2 - x^3)/(1 - x)^4.

%F E.g.f.: 2*(2 + 11*x + 11*x^2 + 2*x^3)*exp(x). (End)

%t Table[4+8*n+10*n^2+4*n^3, {n,0,50}] (* _G. C. Greubel_, Apr 01 2024 *)

%o (Magma) [4+8*n+10*n^2+4*n^3: n in [0..50]]; // _Vincenzo Librandi_, May 15 2011

%o (SageMath) [2*(2*(n+1)^3-(n+1)^2+1) for n in range(51)] # _G. C. Greubel_, Apr 01 2024

%K nonn,easy

%O 0,1

%A _N. J. A. Sloane_, Jan 12 2005

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 April 23 09:22 EDT 2024. Contains 371905 sequences. (Running on oeis4.)