The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 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). 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; refs; listen; history; text; internal format)
 OFFSET 1,5 LINKS EXAMPLE a(11)=3 since k=1, k=3, k=6 are only solutions to 11*k divides binomial(11,k). PROG (PARI) a(n) = sum(k=1, n, (binomial(n, k) % (n*k)) == 0); \\ Michel Marcus, May 18 2014 CROSSREFS Cf. A051556 (similar definition). Sequence in context: A277315 A277326 A050431 * A029386 A277325 A240837 Adjacent sequences:  A051571 A051572 A051573 * A051575 A051576 A051577 KEYWORD nonn AUTHOR Leroy Quet, Dec 11 1999 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 19 21:47 EST 2020. Contains 331066 sequences. (Running on oeis4.)