|
| |
|
|
A123095
|
|
Sum of first n 11th powers.
|
|
2
| |
|
|
0, 1, 2049, 179196, 4373500, 53201625, 415998681, 2393325424, 10983260016, 42364319625, 142364319625, 427675990236, 1170684360924, 2962844754961, 7012409924625, 15662165784000, 33254351828416, 67526248136049
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
COMMENTS
| a(n) = n*A023002(n) - sum [i = 0 ... n-1] A023002(i) [From Bruno Berselli (berselli.bruno(AT)yahoo.it), Apr 27 2010]
|
|
|
LINKS
| B. Berselli, a description of the recursive method n*Ar(n)-sum[i=0...n-1]Ar(i) (Ar(m) is the m-th term of a sequence): website Matem@ticamente. [From Bruno Berselli (berselli.bruno(AT)yahoo.it), Apr 27 2010]
|
|
|
FORMULA
| a(n) = n^2*(n+1)^2*(2*n^8+8*n^7+4*n^6-16*n^5-5*n^4+26*n^3-3*n^2-20*n+10)/24. [From Bruno Berselli (berselli.bruno(AT)yahoo.it), Oct 03 2010]
|
|
|
MAPLE
| [seq(add(i^11, i=1..n), n=0..20)];
a[0]:=0:a[1]:=1:for n from 2 to 50 do a[n]:=a[n-1]+n^11 od: seq(a[n], n=0..13); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Feb 22 2008
|
|
|
MATHEMATICA
| lst={}; s=0; Do[s=s+n^11; AppendTo[lst, s], {n, 10^2}]; lst..or..Table[Sum[k^11, {k, 1, n}], {n, 0, 10^2}] [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Aug 14 2008]
|
|
|
CROSSREFS
| Cf. A023002.
Sequence in context: A017685 A013959 A036089 * A174752 A045059 A183842
Adjacent sequences: A123092 A123093 A123094 * A123096 A123097 A123098
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Sep 27 2006
|
| |
|
|
