login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A172080 (12*n^4+10*n^3-9*n^2-7*n)/6. 1
0, 1, 37, 190, 590, 1415, 2891, 5292, 8940, 14205, 21505, 31306, 44122, 60515, 81095, 106520, 137496, 174777, 219165, 271510, 332710, 403711, 485507, 579140, 685700, 806325, 942201, 1094562, 1264690, 1453915, 1663615, 1895216, 2150192 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

The sequence is related to A172078 by a(n) = n*A172078(n)-sum(A172078(i), i=0..n-1).

This is the case d=8 in the identity n*(n*(n+1)*(2*d*n-2*d+3)/6)-sum(k*(k+1)*(2*d*k-2*d+3)/6, k=0..n-1) = n*(n+1)*(3*d*n^2-d*n+4*n-2*d+2)/12. - Bruno Berselli, May 07 2010, Feb 26 2011

LINKS

Vincenzo Librandi, Table of n, a(n) for n = 0..1000

B. Berselli, A description of the recursive method in Comments lines: website Matem@ticamente (in Italian).

Index entries for linear recurrences with constant coefficients, signature (5,-10,10,-5,1).

FORMULA

a(n) = n*(n+1)*(12*n^2-2*n-7)/6.

G.f.: x*(1 +32*x +15*x^2)/(1 -x)^5.  - Bruno Berselli, Feb 26 2011

MATHEMATICA

CoefficientList[Series[x (1 + 32 x + 15 x^2)/(1 - x)^5, {x, 0, 40}], x] (* Vincenzo Librandi, Jan 01 2014 *)

PROG

(MAGMA) [(12*n^4+10*n^3-9*n^2-7*n)/6: n in [0..50]]; // Vincenzo Librandi, Jan 01 2014

CROSSREFS

Cf. A172078.

Sequence in context: A142410 A164940 A137724 * A142181 A107196 A140027

Adjacent sequences:  A172077 A172078 A172079 * A172081 A172082 A172083

KEYWORD

nonn,easy

AUTHOR

Vincenzo Librandi, Jan 25 2010

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified September 26 15:27 EDT 2017. Contains 292531 sequences.