Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A069876
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A069876 a(1) = 1, a(2) = 2^2 + 3^2; a(n) = (k-n+1)^n + (k-n)^n + ....(k-1)^n + k^n, where k = n(n+1)/2. +0
2
1, 13, 405, 23058, 2078375, 271739011, 48574262275, 11373936899396, 3377498614484589, 1240006139651007925, 551449374186192949841, 292093390490112799117190, 181694111127303339553250275 (list; graph; listen)
OFFSET

1,2

COMMENT

Sum of next n n-th powers.

EXAMPLE

a(1) = 1^1 = 1; a(2) = 2^2 + 3^2 = 13; a(3) = 4^3 + 5^3 + 6^3 = 405, a(4) = 7^4 + 8^4 + 9^4 + 10^4 = 23058.

MATHEMATICA

i1 := n(n-1)/2+1; i2 := n(n-1)/2+n; Table[Sum[i^n, {i, i1, i2}], {n, 20}]

CROSSREFS

Cf. A072474 (s=2), A075664 - A075670 (s=3-10), A075671 (s=n).

Sequence in context: A142122 A009010 A075672 this_sequence A126086 A055203 A088919

Adjacent sequences: A069873 A069874 A069875 this_sequence A069877 A069878 A069879

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Apr 25 2002

EXTENSIONS

More terms from Larry Reeves (larryr(AT)acm.org) and Zak Seidov (zakseidov(AT)yahoo.com), Sep 24 2002

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research