|
Search: id:A051925
|
|
| |
|
| 0, 0, 3, 11, 26, 50, 85, 133, 196, 276, 375, 495, 638, 806, 1001, 1225, 1480, 1768, 2091, 2451, 2850, 3290, 3773, 4301, 4876, 5500, 6175, 6903, 7686, 8526, 9425, 10385, 11408, 12496, 13651, 14875, 16170, 17538, 18981, 20501, 22100, 23780
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
Related to variance of number of inversions of a random permutation of n letters.
Zero followed by partial sums of A005563. [From Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Oct 17 2008]
Definition: A051925=A000330-A000027 (square pyramidal numbers minus natural numbers) [From Andrey Kostenko (Andrey.Kostenko(AT)buseco.monash.edu.au), Nov 30 2008]
|
|
REFERENCES
|
V. N. Sachkov, Probablistic Methods in Combinatorial Analysis, Cambridge, 1997.
J. Wang and H. Li, The upper bound of essential chromatic numbers of hypergraphs, Discr. Math. 254 (2002), 555-564.
|
|
MAPLE
|
a:=n->sum((n+j^2), j=0..n): seq(a(n), n=-1..40); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jul 27 2006
seq(sum(k^2-1, k=1..n), n=0..41); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jan 28 2008
with(finance):seq(add(cashflows([n, k^2, 0], 0 ), k=0..n), n=-1..45); # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Dec 22 2008]
|
|
MATHEMATICA
|
lst={0}; s=0; Do[s+=n^2-1; AppendTo[lst, s], {n, 5!}]; lst...and/or... lst={}; Do[s=n*(2*n+5)*(n-1)/6; AppendTo[lst, s], {n, 0, 5!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Sep 30 2008]
|
|
PROGRAM
|
(PARI) {print1(a=0, ", "); for(n=0, 42, print1(a=a+(n+1)^2-1, ", "))} [From Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Oct 17 2008]
|
|
CROSSREFS
|
Sequence in context: A124078 A096795 A160039 this_sequence A011942 A101612 A123928
Adjacent sequences: A051922 A051923 A051924 this_sequence A051926 A051927 A051928
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Dec 19 1999
|
|
|
Search completed in 0.002 seconds
|
