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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A026898 Sum((n-k+1)^k, k=0..n). 11
1, 2, 4, 9, 23, 66, 210, 733, 2781, 11378, 49864, 232769, 1151915, 6018786, 33087206, 190780213, 1150653921, 7241710930, 47454745804, 323154696185, 2282779990495, 16700904488706, 126356632390298 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

COMMENTS

Row sums of A004248, A009998, A009999.

FORMULA

G.f.: Sum_{n>=0} x^n/(1 - (n+1)*x). [From Paul D. Hanna, Sep 13 2011]

MAPLE

a:=n->sum (j^(n-j), j=1..n): seq(a(n), n=1..23); # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 18 2009]

PROG

(PARI) {a(n)=polcoeff(sum(m=0, n, x^m/(1-(m+1)*x+x*O(x^n))), n)}

CROSSREFS

Cf. A038125, A062810. A026898(n) = A003101(n)+1

First differences are in A047970. First differences of A103439.

Antidiagonal sums of array A003992.

Sequence in context: A129698 A117419 A124461 * A088930 A089844 A113997

Adjacent sequences:  A026895 A026896 A026897 * A026899 A026900 A026901

KEYWORD

nonn

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

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

Content is available under The OEIS End-User License Agreement .

Last modified February 13 22:17 EST 2012. Contains 205566 sequences.