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!)
A368488 a(n) = Sum_{k=0..n} n^k * binomial(k+n-1,k). 2
1, 2, 17, 334, 10417, 442276, 23690809, 1530206742, 115636017473, 10004657077468, 974950612575601, 105653682110368492, 12602144701834193521, 1640558582759557298696, 231448351542446473323113, 35173958220088874039434726, 5728588740444710703061240065 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) = [x^n] 1/((1-x) * (1-n*x)^n).
a(n) ~ 2^(2*n-1) * n^(n - 1/2) / sqrt(Pi). - Vaclav Kotesovec, Dec 27 2023
PROG
(PARI) a(n) = sum(k=0, n, n^k*binomial(k+n-1, k));
CROSSREFS
Main diagonal of A368487.
Sequence in context: A007785 A360609 A201785 * A204249 A242368 A307315
KEYWORD
nonn,easy
AUTHOR
Seiichi Manyama, Dec 26 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 July 20 03:40 EDT 2024. Contains 374441 sequences. (Running on oeis4.)