|
Search: id:A123576
|
|
|
| A123576 |
|
The Kruskal-Macaulay function L_4(n). |
|
+0
3
|
|
| 0, 0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 3, 3, 4, 6, 6, 6, 6, 7, 7, 7, 8, 8, 9, 11, 11, 11, 12, 12, 13, 15, 15, 16, 18, 21, 21, 21, 21, 22, 22, 22, 23, 23, 24, 26, 26, 26, 27, 27, 28, 30, 30, 31, 33, 36, 36, 36, 37, 37, 38, 40, 40, 41, 43, 46, 46, 47, 49, 52, 56, 56, 56, 56, 57, 57, 57, 58
(list; graph; listen)
|
|
|
OFFSET
|
0,10
|
|
|
COMMENT
|
Write n (uniquely) as n = C(n_t,t) + C(n_{t-1},t-1) + ... + C(n_v,v) where n_t > n_{t-1} > ... > n_v >= v >= 1. Then L_t(n) = C(n_t,t+1) + C(n_{t-1},t) + ... + C(n_v,v+1).
|
|
REFERENCES
|
D. E. Knuth, The Art of Computer Programming, Vol. 4, Fascicle 3, Section 7.2.1.3, Table 3.
|
|
MAPLE
|
lowpol := proc(n, t) local x::integer ; x := floor( (n*factorial(t))^(1/t)) ; while binomial(x, t) <= n do x := x+1 ; od ; RETURN(x-1) ; end: C := proc(n, t) local nresid, tresid, m, a ; nresid := n ; tresid := t ; a := [] ; while nresid > 0 do m := lowpol(nresid, tresid) ; a := [op(a), m] ; nresid := nresid - binomial(m, tresid) ; tresid := tresid-1 ; od ; RETURN(a) ; end: L := proc(n, t) local a ; a := C(n, t) ; add( binomial(op(i, a), t+2-i), i=1..nops(a)) ; end: A123576 := proc(n) L(n, 4) ; end: for n from 0 to 80 do printf("%d, ", A123576(n)) ; od ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 18 2007
|
|
CROSSREFS
|
For L_i(n), i=1, 2, 3, 4, 5 see A000217, A111138, A123575, A123576, A123577.
Sequence in context: A089046 A054911 A137267 this_sequence A094824 A029054 A008997
Adjacent sequences: A123573 A123574 A123575 this_sequence A123577 A123578 A123579
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Nov 12 2006
|
|
EXTENSIONS
|
More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 18 2007
|
|
|
Search completed in 0.004 seconds
|
