|
Search: id:A034931
|
|
|
| A034931 |
|
Pascal's triangle read modulo 4. |
|
+0
13
|
|
| 1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 0, 2, 0, 1, 1, 1, 2, 2, 1, 1, 1, 2, 3, 0, 3, 2, 1, 1, 3, 1, 3, 3, 1, 3, 1, 1, 0, 0, 0, 2, 0, 0, 0, 1, 1, 1, 0, 0, 2, 2, 0, 0, 1, 1, 1, 2, 1, 0, 2, 0, 2, 0, 1, 2, 1, 1, 3, 3, 1, 2, 2, 2, 2, 1, 3, 3, 1, 1, 0, 2, 0, 3, 0, 0, 0, 3, 0, 2, 0, 1, 1, 1, 2, 2, 3, 3, 0, 0, 3, 3, 2, 2, 1, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
REFERENCES
|
Huard et al., Europ. J. Combin., 19 (1998), 45-62.
|
|
EXAMPLE
|
Triangle begins:
{1},
{1, 1},
{1, 2, 1},
{1, 3, 3, 1},
{1, 0, 2, 0, 1},
{1, 1, 2, 2, 1, 1},
{1, 2, 3, 0, 3, 2, 1},
{1, 3, 1, 3, 3, 1, 3, 1},
{1, 0, 0, 0, 2, 0, 0, 0, 1},
{1, 1, 0, 0, 2, 2, 0, 0, 1, 1},
{1, 2, 1, 0, 2, 0, 2, 0, 1, 2, 1},
{1, 3, 3, 1, 2, 2, 2, 2, 1, 3, 3, 1},
|
|
MATHEMATICA
|
Mod[ Flatten[ Table[ Binomial[n, k], {n, 0, 13}, {k, 0, n}]], 4] (from Robert G. Wilson v May 26 2004)
|
|
CROSSREFS
|
Cf. A007318, A047999, A083093, A034930, A008975, A034932.
Adjacent sequences: A034928 A034929 A034930 this_sequence A034932 A034933 A034934
Sequence in context: A136458 A048805 A129571 this_sequence A090402 A026082 A117185
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
