id:A051556 - OEIS Search Results

Search: id:A051556

Displaying 1-1 of 1 results found.

page 1

a(n) = number of 0<=k<=n such that n+k divides binomial(n,k).

+0
1

1, 0, 0, 1, 0, 0, 0, 1, 2, 1, 1, 1, 0, 0, 0, 6, 3, 1, 2, 2, 1, 3, 2, 3, 6, 2, 3, 5, 5, 2, 3, 6, 4, 6, 5, 10, 12, 6, 4, 10, 8, 3, 8, 5, 8, 5, 3, 5, 11, 4, 4, 10, 7, 8, 9, 19, 21, 12, 8, 7, 8, 4, 3, 17, 13, 19, 23, 10, 11, 13, 16, 18, 14, 9, 11, 19, 13, 9, 16, 16, 25, 21, 17, 15, 18, 13, 16, 17, 19 (list; graph; listen)

	OFFSET	`1,9`
	EXAMPLE	`For n=9, 0<=k<=n, n+k divides C(n,k) only when k=3 and k=5, so a(9)=2.`
	CROSSREFS	`Adjacent sequences: A051553 A051554 A051555 this_sequence A051557 A051558 A051559` `Sequence in context: A015318 A026836 A089052 this_sequence A081602 A077267 A134022`
	KEYWORD	`nonn`
	AUTHOR	`Leroy Quet (qq-quet(AT)mindspring.com)`

page 1

Search completed in 0.002 seconds

Last modified October 9 14:06 EDT 2008. Contains 144831 sequences.

AT&T Labs Research