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!)
A033578 a(n) = (3*n - 1)*(4*n - 1). 1

%I #21 Sep 08 2022 08:44:51

%S 1,6,35,88,165,266,391,540,713,910,1131,1376,1645,1938,2255,2596,2961,

%T 3350,3763,4200,4661,5146,5655,6188,6745,7326,7931,8560,9213,9890,

%U 10591,11316,12065,12838,13635,14456,15301,16170,17063,17980,18921,19886,20875

%N a(n) = (3*n - 1)*(4*n - 1).

%H Nathaniel Johnston, <a href="/A033578/b033578.txt">Table of n, a(n) for n = 0..5000</a>

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

%F From _G. C. Greubel_, Oct 09 2019: (Start)

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

%F E.g.f.: (1 + 5*x + 12*x^2)*exp(x). (End)

%p seq((3*n-1)*(4*n-1),n=0..50); # _Nathaniel Johnston_, Jun 26 2011

%t Table[(3*n-1)*(4*n-1), {n, 0, 50}] (* _Vladimir Joseph Stephan Orlovsky_, Jun 26 2011 *)

%o (PARI) a(n)=(3*n-1)*(4*n-1) \\ _Charles R Greathouse IV_, Jun 17 2017

%o (Magma) [(3*n-1)*(4*n-1): n in [0..50]]; // _G. C. Greubel_, Oct 09 2019

%o (Sage) [(3*n-1)*(4*n-1) for n in (0..50)] # _G. C. Greubel_, Oct 09 2019

%o (GAP) List([0..50], n-> (3*n-1)*(4*n-1)); # _G. C. Greubel_, Oct 09 2019

%Y Cf. A033577.

%K nonn,easy

%O 0,2

%A _N. J. A. Sloane_

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 March 28 20:05 EDT 2024. Contains 371254 sequences. (Running on oeis4.)