id:A051574 - OEIS Search Results

Search: id:A051574

Displaying 1-1 of 1 results found.

page 1

a(n) = number of k, 1<=k<=n, such that n*k) divides binomial(n,k).

+0
1

1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 3, 1, 3, 1, 1, 1, 3, 1, 5, 3, 2, 1, 1, 1, 2, 2, 2, 4, 7, 1, 2, 2, 5, 6, 3, 1, 6, 3, 2, 1, 4, 1, 2, 1, 2, 2, 2, 1, 4, 5, 9, 5, 8, 4, 7, 3, 9, 6, 8, 2, 6, 3, 1, 4, 11, 5, 9, 4, 5, 1, 4, 1, 7, 4, 2, 4, 8, 3, 4, 1, 6, 11, 15, 3, 7, 5, 4, 5, 9, 1, 5, 3, 2, 2, 1, 1, 4, 2, 7, 7, 19, 8 (list; graph; listen)

	OFFSET	`1,5`
	LINKS	`Leroy Quet, Home Page (listed in lieu of email address)`
	EXAMPLE	`a(11)=3 since k=1, k=3, k=6 are only solutions to 11*k divides binomial(11,k).`
	CROSSREFS	`Sequence in context: A128494 A110730 A050431 this_sequence A029386 A060502 A035439` `Adjacent sequences: A051571 A051572 A051573 this_sequence A051575 A051576 A051577`
	KEYWORD	`nonn`
	AUTHOR	`Leroy Quet`

page 1

Search completed in 0.002 seconds

Last modified December 6 19:58 EST 2009. Contains 170429 sequences.

AT&T Labs Research