|
Search: id:A059302
|
|
| |
|
| -1, -1, 5, 25, 70, 154, 294, 510, 825, 1265, 1859, 2639, 3640, 4900, 6460, 8364, 10659, 13395, 16625, 20405, 24794, 29854, 35650, 42250, 49725, 58149, 67599, 78155, 89900, 102920, 117304, 133144, 150535, 169575, 190365, 213009, 237614, 264290, 293150, 324310, 357889, 394009, 432795, 474375
(list; graph; listen)
|
|
|
OFFSET
|
2,3
|
|
|
REFERENCES
|
L. Comtet, Advanced Combinatorics, Reidel, 1974, p. 139, b(n,n-2).
|
|
FORMULA
|
(n-1)n(n+1)(3n-10)/24.
If we define f(n,i,a)=sum(binomial(n,k)*stirling1(n-k,i)*product(-a-j,j=0..k-1),k=0..n-i), then a(n-1) = f(n,n-2,-1), for n>=3. [From Milan R. Janjic (agnus(AT)blic.net), Dec 20 2008]
|
|
MAPLE
|
with(combinat): for n from 3 to 100 do for k from n-2 to n-2 do printf(`%d, `, sum(binomial(l, k)*k^(l-k)*stirling1(n, l), l=k..n)) od: od:
|
|
MATHEMATICA
|
f[n_]:=3*n-1; s1=s2=s3=0; lst={}; Do[a=f[n]; s1+=a; s2+=s1; s3+=s2; AppendTo[lst, s3], {n, 0, 5!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Jun 27 2009]
|
|
CROSSREFS
|
Sequence in context: A088959 A018782 A146665 this_sequence A147130 A154286 A078234
Adjacent sequences: A059299 A059300 A059301 this_sequence A059303 A059304 A059305
|
|
KEYWORD
|
sign,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Jan 26 2001
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), Jan 26 2001
|
|
|
Search completed in 0.002 seconds
|
