|
Search: id:A123578
|
|
|
| A123578 |
|
The Kruskal-Macaulay function M_2(n). |
|
+0
5
|
|
| 0, 1, 2, 2, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 13
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
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 M_t(n) = C(n_t-1,t-1) + C(n_{t-1}-1,t-2) + ... + C(n_v-1,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: M := proc(n, t) local a ; a := C(n, t) ; add( binomial(op(i, a)-1, t-i), i=1..nops(a)) ; end: A123578 := proc(n) M(n, 2) ; end: for n from 0 to 120 do printf("%d, ", A123578(n)) ; od ; - R. J. Mathar (mathar(AT)strw.leideuniv.nl), Mar 14 2007
|
|
CROSSREFS
|
For M_i(n), i=1,2,3,4,5 see A000127, A123578, A123579, A123580, A123731.
Sequence in context: A087847 A107436 A002024 this_sequence A087845 A130146 A113764
Adjacent sequences: A123575 A123576 A123577 this_sequence A123579 A123580 A123581
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas, Nov 12 2006
|
|
EXTENSIONS
|
More terms from R. J. Mathar (mathar(AT)strw.leideuniv.nl), Mar 14 2007
|
|
|
Search completed in 0.002 seconds
|
