OFFSET
0,5
COMMENTS
The C(n,k) are also called combinations of n with size k (see A181842).
Main diagonal gives: A003418. Lower diagonal gives: A094308. Column k=1 gives: A000217. - Alois P. Heinz, Jul 29 2013
LINKS
Alois P. Heinz, Rows n = 0..46, flattened
EXAMPLE
[0] 1
[1] 1 1
[2] 1 3 2
[3] 1 6 11 6
[4] 1 10 31 34 12
[5] 1 15 81 189 182 60
[6] 1 21 141 393 494 282 60
MAPLE
with(combstruct):
a181853_row := proc(n) local k, L, l, R, comb;
R := NULL;
for k from 0 to n do
L := 0;
comb := iterstructs(Combination(n), size=k):
while not finished(comb) do
l := nextstruct(comb);
L := L + ilcm(op(l));
od;
R := R, L;
od;
R end:
# second Maple program:
b:= proc(n, k) option remember; `if`(k=0, [1],
[`if`(k<n, b(n-1, k), [])[], seq(ilcm(c, n), c=b(n-1, k-1))])
end:
T:= (n, k)-> add(c, c=b(n, k)):
seq(seq(T(n, k), k=0..n), n=0..10); # Alois P. Heinz, Jul 29 2013
# third Maple program:
b:= proc(n, m) option remember; expand(`if`(n=0, m,
b(n-1, ilcm(m, n))*x+b(n-1, m)))
end:
T:= n-> (p-> seq(coeff(p, x, i), i=0..n))(b(n, 1)):
seq(T(n), n=0..10); # Alois P. Heinz, Sep 05 2023
MATHEMATICA
t[_, 0] = 1; t[n_, k_] := Sum[LCM @@ c, {c, Subsets[Range[n], {k}]}]; Table[t[n, k], {n, 0, 8}, {k, 0, n}] // Flatten (* Jean-François Alcover, Jul 29 2013 *)
PROG
(Sage) # (After Alois P. Heinz)
@CachedFunction
def b(n, k):
if k == 0: return [1]
w = b(n-1, k) if k<n else [0]
return w + [lcm(c, n) for c in b(n-1, k-1)]
def T(n, k): return add(b(n, k))
flatten([[T(n, k) for k in (0..n)] for n in (0..10)])
# Peter Luschny, Jul 29 2013
CROSSREFS
KEYWORD
nonn,tabl
AUTHOR
Peter Luschny, Dec 06 2010
STATUS
approved