Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A026898
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A026898 Sum((n-k+1)^k, k=0..n). +0
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; listen)
OFFSET

0,2

COMMENT

Row sums of A004248, A009998, A009999.

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 this_sequence A088930 A089844 A113997

Adjacent sequences: A026895 A026896 A026897 this_sequence A026899 A026900 A026901

KEYWORD

nonn

AUTHOR

njas

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 19 08:04 EDT 2008. Contains 142098 sequences.


AT&T Labs Research