This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A127319 a(n)={binomial[n,(sum of decimal digits of n)] mod n}, with n>=1. 0
 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 4, 0, 0, 10, 0, 0, 2, 0, 10, 7, 11, 0, 4, 0, 13, 3, 14, 0, 10, 0, 0, 22, 0, 0, 4, 0, 0, 13, 30, 0, 28, 0, 11, 5, 23, 0, 20, 0, 10, 34, 0, 0, 6, 0, 0, 0, 0, 0, 40, 0, 31, 7, 32, 0, 22, 0, 0, 46, 10, 0, 8, 0, 0, 50, 0, 55, 26, 0, 30, 9, 0, 0, 42, 0, 0, 0, 11, 0, 10, 0, 0 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,12 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 i); print(k); od; end: P(100); MATHEMATICA Table[Mod[Binomial[n, Total[IntegerDigits[n]]], n], {n, 100}] (* From Harvey P. Dale, Dec 19 2011 *) CROSSREFS Sequence in context: A002915 A127733 A127774 * A035539 A178517 A049207 Adjacent sequences:  A127316 A127317 A127318 * A127320 A127321 A127322 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 | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .