OFFSET
0,10
COMMENTS
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, May 18 2007
MATHEMATICA
(+ The function L(n, t) is defined in A123575 *)
a[n_] := L[n, 4];
a /@ Range[0, 80] (* Jean-François Alcover, Mar 29 2020 *)
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, Nov 12 2006
EXTENSIONS
More terms from R. J. Mathar, May 18 2007
STATUS
approved