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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A081372 Binomial coefficients C(n,j) reduced modulo j, j=1..n; read by rows, j=0 is omitted because of n mod 0. a(n) is the number of zero residues counted in n-th row. 0
 1, 1, 1, 2, 2, 1, 1, 2, 4, 3, 3, 3, 3, 1, 1, 3, 3, 5, 5, 4, 3, 1, 1, 2, 4, 2, 6, 7, 7, 2, 2, 8, 7, 6, 5, 6, 6, 4, 2, 4, 4, 2, 2, 2, 4, 2, 2, 4, 8, 12, 9, 8, 8, 12, 10, 12, 11, 8, 8, 6, 6, 3, 4, 14, 12, 9, 9, 9, 7, 4, 4, 7, 7, 6, 9, 11, 10, 4, 4, 6, 17, 15, 15, 11, 9, 6, 6, 9, 9, 6, 5, 6, 5, 2, 1, 4, 4, 9, 12 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS EXAMPLE n=10: C(10,j) mod j, j=1..10, is {0,1,0,2,2,0,1,5,1,1} includes 3 zeros, so a(10)=3. MATHEMATICA Flatten[Table[Count[Table[Mod[Binomial[n, j], j], {j, 1, n}], 0], {n, 1, 256}], 1] CROSSREFS Cf. A007318, A081371. Sequence in context: A239473 A135229 A257543 * A101489 A104156 A070166 Adjacent sequences:  A081369 A081370 A081371 * A081373 A081374 A081375 KEYWORD nonn,tabl AUTHOR Labos Elemer, Mar 21 2003 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 September 25 12:47 EDT 2020. Contains 337344 sequences. (Running on oeis4.)