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!)
A368536 a(n) = Sum_{k=1..n} binomial(k+1,2) * n^k. 1
0, 1, 14, 192, 2996, 53955, 1110786, 25808160, 668740808, 19129643325, 598902606310, 20371538593296, 748148581865532, 29505258575474591, 1243695052515891626, 55800352470853933440, 2655106829377875895056, 133547801741230053460761 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
a(n) = [x^n] n*x/((1-x) * (1-n*x)^3).
a(n) = n * (n^n * (n^4-n^3-3*n^2+3*n+2) - 2)/(2 * (n-1)^3) for n > 1.
PROG
(PARI) a(n) = sum(k=1, n, binomial(k+1, 2)*n^k);
CROSSREFS
Cf. A368526.
Sequence in context: A198657 A055759 A368702 * A275084 A086946 A158530
KEYWORD
nonn,easy
AUTHOR
Seiichi Manyama, Dec 29 2023
STATUS
approved

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 11 23:45 EDT 2024. Contains 375082 sequences. (Running on oeis4.)