The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A127318 a(n)={binomial[n,(sum of decimal digits of n)] mod (sum of digits of n)}, with n>=1. 0
 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 3, 2, 1, 2, 6, 2, 8, 0, 1, 3, 4, 4, 3, 3, 3, 0, 2, 1, 1, 1, 4, 4, 4, 4, 6, 3, 4, 2, 3, 4, 6, 3, 5, 1, 4, 8, 3, 0, 4, 0, 6, 6, 0, 5, 0, 4, 0, 4, 1, 1, 7, 6, 5, 4, 5, 8, 1, 3, 0, 8, 6, 6, 8, 5, 6, 5, 4, 6, 0, 0, 7, 6, 6, 10, 0, 3, 5, 1, 3, 8, 7, 7, 1, 4, 2, 5, 10, 0, 0, 1, 3, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,13 LINKS MAPLE P:=proc(n) local i, k, w; for i from 1 by 1 to n do w:=0; k:=i; while k>0 do w:=w+k-(trunc(k/10)*10); k:=trunc(k/10); od; k:=(binomial(i, w) mod w); print(k); od; end: P(100); MATHEMATICA f[n_]:=Module[{sd=Total[IntegerDigits[n]]}, Mod[Binomial[n, sd], sd]]; Array[f, 110] (* Harvey P. Dale, May 18 2011 *) CROSSREFS Sequence in context: A329587 A230120 A136531 * A349930 A274512 A175947 Adjacent sequences:  A127315 A127316 A127317 * A127319 A127320 A127321 KEYWORD easy,nonn,base AUTHOR Paolo P. Lava and Giorgio Balzarotti, Mar 29 2007 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 26 04:43 EDT 2022. Contains 354074 sequences. (Running on oeis4.)