login
A137424
a(n)=C{Sum_digits(n),[n mod Sum_digits(n)]}, n>=1.
0
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 4, 5, 20, 21, 8, 1, 10, 1, 1, 6, 10, 1, 35, 28, 1, 45, 330, 1, 4, 10, 20, 7, 56, 1, 120, 462, 220, 1, 5, 1, 7, 70, 1, 210, 165, 1, 286, 1, 20, 35, 56, 1, 252, 11, 220, 1716, 364, 1, 21, 28, 1, 210, 11, 924, 78, 91, 5005, 1, 8, 1, 120, 165, 220, 78
OFFSET
0,11
MAPLE
P:=proc(n) local a, k, i; for i from 1 by 1 to n do a:=0; k:=i; while k>0 do a:=a+(k mod 10); k:=trunc(k/10); od; k:=binomial(a, (i mod a)); print(k); od; end: P(101);
CROSSREFS
Sequence in context: A209337 A243004 A375156 * A083007 A309845 A002987
KEYWORD
easy,nonn
AUTHOR
STATUS
approved