cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A081371 Binomial coefficients C[n,j] reduced modulo j, j=1,...n; read by rows, j=0 is omitted because of mod[n,0].

Original entry on oeis.org

0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 2, 3, 1, 1, 0, 1, 2, 3, 1, 1, 1, 0, 0, 2, 2, 1, 4, 1, 1, 0, 0, 0, 2, 1, 0, 1, 1, 1, 0, 1, 0, 2, 2, 0, 1, 5, 1, 1, 0, 1, 0, 2, 2, 0, 1, 5, 1, 1, 1, 0, 0, 1, 3, 2, 0, 1, 7, 4, 6, 1, 1, 0, 0, 1, 3, 2, 0, 1, 7, 4, 6, 1, 1, 1, 0, 1, 1, 1, 2, 3, 2, 3, 4, 1, 1, 7, 1, 1
Offset: 1

Views

Author

Labos Elemer, Mar 21 2003

Keywords

Examples

			Triangle begins:
0,
0,1,
0,1,1,
0,0,1,1,
0,0,1,1,1,
0,1,2,3,1,1,
0,1,2,3,1,1,1,
		

Crossrefs

Cf. A007318.

Programs

  • Mathematica
    Flatten[Table[Table[Mod[Binomial[n, j], j], {j, 1, n}], {n, 1, 50}], 1]
  • PARI
    tabl(nn)=for(n=1, nn, for (k=1, n, print1(binomial(n, k) % k, ", ")); print) \\ Michel Marcus, Feb 01 2017