Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #3 Aug 24 2012 10:50:00
%S 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,
%T 4,10,20,7,56,1,120,462,220,1,5,1,7,70,1,210,165,1,286,1,20,35,56,1,
%U 252,11,220,1716,364,1,21,28,1,210,11,924,78,91,5005,1,8,1,120,165,220,78
%N a(n)=C{Sum_digits(n),[n mod Sum_digits(n)]}, n>=1.
%p 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);
%Y Cf. A070635, A110366.
%K easy,nonn
%O 0,11
%A _Paolo P. Lava_ and _Giorgio Balzarotti_, Apr 17 2008