Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
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!)

Revision History for A007587

(Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A007587 12-gonal (or dodecagonal) pyramidal numbers: n(n+1)(10n-7)/6.
(history; published version)
#56 by Charles R Greathouse IV at Thu Sep 08 08:44:35 EDT 2022
PROG

(MAGMAMagma) [ n eq 1 select 0 else Self(n-1)+(n-1)*(5*n-9): n in [1..45] ]; // Klaus Brockhaus, Nov 20 2008

Discussion
Thu Sep 08 08:44
OEIS Server: https://oeis.org/edit/global/2944
#55 by Jon E. Schoenfield at Fri Jun 04 22:48:26 EDT 2021
STATUS

proposed

approved

#54 by Jon E. Schoenfield at Fri Jun 04 20:54:24 EDT 2021
STATUS

editing

proposed

#53 by Jon E. Schoenfield at Fri Jun 04 20:54:22 EDT 2021
COMMENTS

Binomial transform of [1, 12, 21, 10, 0, 0, 0,...] = (, ...] = (1, 13, 46, 110,...). - _, ...). - _Gary W. Adamson_, Nov 28 2007

STATUS

approved

editing

#52 by Joerg Arndt at Fri Aug 30 04:19:34 EDT 2019
STATUS

reviewed

approved

#51 by Michel Marcus at Fri Aug 30 03:36:40 EDT 2019
STATUS

proposed

reviewed

#50 by G. C. Greubel at Fri Aug 30 03:15:18 EDT 2019
STATUS

editing

proposed

#49 by G. C. Greubel at Fri Aug 30 03:14:56 EDT 2019
COMMENTS

This sequence is related to A000566 by a(n) = n*A000566(n)-sum(A000566(i), ) - Sum_{i=0..n-1} A000566(i) and this is the case d=5 in the identity n*(n*(d*n-d+2)/2)-sum() - Sum_{k=0..n-1} k*(d*k-d+2)/2, k=0..n-1) = = n*(n+1)*(2*d*n- - 2*d+ + 3)/6. - Bruno Berselli, Oct 18 2010

FORMULA

a(n) = sum( (Sum_{i=0..n-1} (n-i)*(10*i+1), i=0..n-1 ), with a(0)=0. - Bruno Berselli, Feb 10 2014

a(n) = 4*a(n-1)-) - 6*a(n-2)+) + 4*a(n-3)-) - a(n-4). - Wesley Ivan Hurt, Oct 23 2014

MATHEMATICA

CoefficientList[Series[x ((1 + 9 x) / (+9x)/(1 - -x)^4, {x, , 0, 40, 45}], x] (* Vincenzo Librandi, Jun 20 2013 *)

PROG

(MAGMA) [ n eq 1 select 0 else Self(n-1)+(n-1)*(5*n-9): n in [1..3545] ]; // Klaus Brockhaus, Nov 20 2008

(PARI) vector(45, n, n*(n-1)*(10*n-17)/6) \\ G. C. Greubel, Aug 30 2019

(Sage) [n*(n+1)*(10*n-7)/6 for n in (0..45)] # G. C. Greubel, Aug 30 2019

(GAP) List([0..45], n-> n*(n+1)*(10*n-7)/6); # G. C. Greubel, Aug 30 2019

AUTHOR

N. J. A. Sloane, _R. K. Guy_._

STATUS

approved

editing

#48 by Charles R Greathouse IV at Wed Oct 07 12:09:59 EDT 2015
STATUS

editing

approved

#47 by Charles R Greathouse IV at Wed Oct 07 12:09:42 EDT 2015
FORMULA

a(n) = Sum_{k=0..n} k*(5*k-4). [_). - _Klaus Brockhaus_, Nov 20 2008]

a(n) = sum( (n-i)*(10*i+1), i=0..n-1 ), with a(0)=0. [_. - _Bruno Berselli_, Feb 10 2014]

PROG

(PARI) a(n)=if(n, ([0, 1, 0, 0; 0, 0, 1, 0; 0, 0, 0, 1; -1, 4, -6, 4]^n*[0; 1; 13; 46])[1, 1], 0) \\ Charles R Greathouse IV, Oct 07 2015

CROSSREFS

Cf. See similar sequences listed in A237616.

STATUS

approved

editing

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 August 18 08:16 EDT 2024. Contains 375255 sequences. (Running on oeis4.)