|
|
A081371
|
|
Binomial coefficients C[n,j] reduced modulo j, j=1,...n; read by rows, j=0 is omitted because of mod[n,0].
|
|
6
|
|
|
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
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,18
|
|
LINKS
|
|
|
EXAMPLE
|
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,
|
|
MATHEMATICA
|
Flatten[Table[Table[Mod[Binomial[n, j], j], {j, 1, n}], {n, 1, 50}], 1]
|
|
PROG
|
(PARI) tabl(nn)=for(n=1, nn, for (k=1, n, print1(binomial(n, k) % k, ", ")); print) \\ Michel Marcus, Feb 01 2017
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|