login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A081371 Binomial coefficients C[n,j] reduced modulo j, j=1,...n; read by rows, j=0 is omitted because of mod[n,0]. 4
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; internal format)
OFFSET

1,18

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]

CROSSREFS

Cf. A007318.

Sequence in context: A171996 A175669 A004579 * A027870 A070077 A122587

Adjacent sequences:  A081368 A081369 A081370 * A081372 A081373 A081374

KEYWORD

nonn,tabl

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Mar 21 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 15:25 EST 2012. Contains 205627 sequences.