|
Search: id:A006463
|
|
|
| A006463 |
|
Convolve natural numbers with characteristic function of triangular numbers. |
|
+0
2
|
|
| 0, 0, 1, 2, 4, 6, 8, 11, 14, 17, 20, 24, 28, 32, 36, 40, 45, 50, 55, 60, 65, 70, 76, 82, 88, 94, 100, 106, 112, 119, 126, 133, 140, 147, 154, 161, 168, 176, 184, 192, 200, 208, 216, 224, 232, 240, 249, 258, 267, 276, 285, 294, 303, 312, 321, 330, 340, 350, 360
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
a(n) = length (i.e. number of elements minus 1) of longest chain in partition lattice Par(n). Par(n) is the set of partitions of n under "dominance order": partition P is <= partition Q iff the sum of the largest k parts of P is <= the corresponding sum for Q for all k.
|
|
REFERENCES
|
R. P. Stanley, Enumerative Combinatorics, Cambridge, Vol. 2, 1999; see Problem 7.2(f).
|
|
FORMULA
|
Let n=binomial(m+1, 2)+r, 0<=r<=m; then a(n) = (1/3)*m*(m^2+3*r-1).
G.f.: (psi(x)-1)*x/(1-x)^2 where psi() is a Ramanujan theta function. - Michael Somos Mar 06 2006
a(n) = sum_(k=0..n) A003056(k) - Daniele Parisse (daniele.parisse(AT)eads.com), Jul 10 2007
|
|
EXAMPLE
|
a(6)=8; one longest chain consists of these 9 partitions: 6, 5+1, 4+2, 3+3, 3+2+1, 2+2+2, 2+2+1+1, 2+1+1+1+1, 1+1+1+1+1+1. Others are obtained by changing 3+3 to 4+1+1 or 2+2+2 to 3+1+1+1.
|
|
PROGRAM
|
(PARI) {a(n)=local(x); if(n<0, 0, x=(sqrtint(1+8*n)-1)\2; x*(x^2-1+3*(n-x*(x+1)/2))/3)} /* Michael Somos Mar 06 2006 */
|
|
CROSSREFS
|
Cf. A076269.
Cf. A003056.
Sequence in context: A129896 A134421 A092777 this_sequence A060655 A117490 A032514
Adjacent sequences: A006460 A006461 A006462 this_sequence A006464 A006465 A006466
|
|
KEYWORD
|
nonn,easy,nice
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
EXTENSIONS
|
Edited by Dean Hickerson (dean.hickerson(AT)yahoo.com), Nov 09 2002
|
|
|
Search completed in 0.002 seconds
|
