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!)
A368489 a(n) = Sum_{k=0..n} n^k * binomial(k+n,k). 1
1, 3, 31, 643, 20421, 873806, 46994011, 3042431715, 230249448841, 19940350062394, 1944516598602711, 210829412453667998, 25156743053019602701, 3275876521195372322892, 462262670054775645538099, 70264375447526610838701091 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
FORMULA
a(n) = [x^n] 1/((1-x) * (1-n*x)^(n+1)).
a(n) ~ 4^n * n^(n - 1/2) / sqrt(Pi). - Vaclav Kotesovec, Dec 27 2023
PROG
(PARI) a(n) = sum(k=0, n, n^k*binomial(k+n, k));
CROSSREFS
Sequence in context: A222895 A373754 A105293 * A104841 A092552 A322487
KEYWORD
nonn,easy
AUTHOR
Seiichi Manyama, Dec 27 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 September 15 03:00 EDT 2024. Contains 375931 sequences. (Running on oeis4.)