|
Search: id:A143333
|
|
|
| A143333 |
|
Only odd and zero version of Pascal's triangle sequence: t(n,m)=Mod[Binomial[n, m], 2]*Binomial[n, m]. |
|
+0
1
|
|
| 1, 1, 1, 1, 0, 1, 1, 3, 3, 1, 1, 0, 0, 0, 1, 1, 5, 0, 0, 5, 1, 1, 0, 15, 0, 15, 0, 1, 1, 7, 21, 35, 35, 21, 7, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 9, 0, 0, 0, 0, 0, 0, 9, 1, 1, 0, 45, 0, 0, 0, 0, 0, 45, 0, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,8
|
|
|
COMMENT
|
Row sums are:{1, 2, 2, 8, 2, 12, 32, 128, 2, 20, 92}.
|
|
FORMULA
|
t(n,m)=Mod[Binomial[n, m], 2]*Binomial[n, m].
|
|
EXAMPLE
|
{1},
{1, 1},
{1, 0, 1},
{1, 3, 3, 1},
{1, 0, 0, 0, 1},
{1, 5, 0, 0, 5, 1},
{1, 0, 15, 0, 15, 0, 1},
{1, 7, 21, 35, 35, 21, 7, 1},
{1, 0, 0, 0, 0, 0, 0, 0, 1},
{1, 9, 0, 0, 0, 0, 0, 0, 9, 1},
{1, 0, 45, 0, 0, 0, 0, 0, 45, 0, 1}
|
|
MATHEMATICA
|
t[n_, m_] = Mod[Binomial[n, m], 2]*Binomial[n, m]; Table[Table[t[n, m], {m, 0, n}], {n, 0, 10}]; Flatten[%]
|
|
CROSSREFS
|
Sequence in context: A122850 A132062 A065547 this_sequence A065551 A059441 A059790
Adjacent sequences: A143330 A143331 A143332 this_sequence A143334 A143335 A143336
|
|
KEYWORD
|
nonn,uned,probation
|
|
AUTHOR
|
Roger L. Bagula and Gary W. Adamson (rlbagulatftn(AT)yahoo.com), Oct 21 2008
|
|
|
Search completed in 0.002 seconds
|
