|
Search: id:A034932
|
|
|
| A034932 |
|
Pascal's triangle read modulo 16. |
|
+0
12
|
|
| 1, 1, 1, 1, 2, 1, 1, 3, 3, 1, 1, 4, 6, 4, 1, 1, 5, 10, 10, 5, 1, 1, 6, 15, 4, 15, 6, 1, 1, 7, 5, 3, 3, 5, 7, 1, 1, 8, 12, 8, 6, 8, 12, 8, 1, 1, 9, 4, 4, 14, 14, 4, 4, 9, 1, 1, 10, 13, 8, 2, 12, 2, 8, 13, 10, 1, 1, 11, 7, 5, 10, 14, 14, 10
(list; table; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
REFERENCES
|
Huard et al., Europ. J. Combin., 19 (1998), 45-62.
|
|
FORMULA
|
T(i, j) = binomial(i, j) (mod 16)
|
|
MATHEMATICA
|
Mod[ Flatten[ Table[ Binomial[n, k], {n, 0, 13}, {k, 0, n}]], 16] (from Robert G. Wilson v May 26 2004)
|
|
CROSSREFS
|
Cf. A007318, A047999, A083093, A034931, A034930, A008975.
Adjacent sequences: A034929 A034930 A034931 this_sequence A034933 A034934 A034935
Sequence in context: A061676 A095145 A095144 this_sequence A094495 A117440 A118433
|
|
KEYWORD
|
nonn,tabl
|
|
AUTHOR
|
njas
|
|
|
Search completed in 0.002 seconds
|
