id:A127319 - OEIS Search Results

Search: id:A127319

Displaying 1-1 of 1 results found.

page 1

a(n)={binomial[n,(sum of digits of n)] mod n}, with n>=1.

+0
1

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; listen)

	OFFSET	`0,12`
	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);`
	CROSSREFS	`Adjacent sequences: A127316 A127317 A127318 this_sequence A127320 A127321 A127322` `Sequence in context: A002915 A127733 A127774 this_sequence A035539 A049207 A092219`
	KEYWORD	`easy,nonn`
	AUTHOR	`Paolo P. Lava & Giorgio Balzarotti (ppl(AT)spl.at), Mar 29 2007`

page 1

Search completed in 0.002 seconds

Last modified October 6 12:54 EDT 2008. Contains 144667 sequences.

AT&T Labs Research