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].

This page as a plain text file.
%I A081371 #8 Feb 01 2017 14:16:13
%S A081371 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,
%T A081371 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,
%U A081371 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
%N A081371 Binomial coefficients C[n,j] reduced modulo j, j=1,...n; read by rows, j=0 is omitted because of mod[n,0].
%H A081371 Michel Marcus, <a href="/A081371/b081371.txt">Rows n = 1..100 of triangle, flattened</a>
%e A081371 Triangle begins:
%e A081371 0,
%e A081371 0,1,
%e A081371 0,1,1,
%e A081371 0,0,1,1,
%e A081371 0,0,1,1,1,
%e A081371 0,1,2,3,1,1,
%e A081371 0,1,2,3,1,1,1,
%t A081371 Flatten[Table[Table[Mod[Binomial[n, j], j], {j, 1, n}], {n, 1, 50}], 1]
%o A081371 (PARI) tabl(nn)=for(n=1, nn, for (k=1, n, print1(binomial(n, k) % k, ", ")); print) \\ _Michel Marcus_, Feb 01 2017
%Y A081371 Cf. A007318.
%K A081371 nonn,tabl
%O A081371 1,18
%A A081371 _Labos Elemer_, Mar 21 2003