login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A051574 a(n) = number of k, 1<=k<=n, such that n*k) divides binomial(n,k). 0
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; refs; listen; history; internal format)
OFFSET

1,5

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: A110730 A198339 A050431 * A029386 A060502 A035439

Adjacent sequences:  A051571 A051572 A051573 * A051575 A051576 A051577

KEYWORD

nonn

AUTHOR

Leroy Quet

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 .

Last modified February 15 11:25 EST 2012. Contains 205777 sequences.