|
Search: id:A143334
|
|
|
| A143334 |
|
Only odd and even version of Pascal's triangle sequence: t(n,m)=If[m*(n - m) == 0, 1, Mod[Binomial[n, m], 2]*Prime[n] + (1 - Mod[Binomial[n, m], 2])*(Prime[n] + 1)]. |
|
+0
1
|
|
| 1, 1, 1, 1, 4, 1, 1, 5, 5, 1, 1, 8, 8, 8, 1, 1, 11, 12, 12, 11, 1, 1, 14, 13, 14, 13, 14, 1, 1, 17, 17, 17, 17, 17, 17, 1, 1, 20, 20, 20, 20, 20, 20, 20, 1, 1, 23, 24, 24, 24, 24, 24, 24, 23, 1, 1, 30, 29, 30, 30, 30, 30, 30, 29, 30, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,5
|
|
|
COMMENT
|
Row sums are:{1, 2, 6, 12, 26, 48, 70, 104, 142, 192, 270}.
|
|
FORMULA
|
t(n,m)=If[m*(n - m) == 0, 1, Mod[Binomial[n, m], 2]*Prime[n] + (1 - Mod[Binomial[n, m], 2])*(Prime[n] + 1)].
|
|
EXAMPLE
|
{1},
{1, 1},
{1, 4, 1},
{1, 5, 5, 1},
{1, 8, 8, 8, 1},
{1, 11, 12, 12, 11, 1},
{1, 14, 13, 14, 13, 14, 1},
{1, 17, 17, 17, 17, 17, 17, 1},
{1, 20, 20, 20, 20, 20, 20, 20, 1},
{1, 23, 24, 24, 24, 24, 24, 24, 23, 1},
{1, 30, 29, 30, 30, 30, 30, 30, 29, 30, 1}
|
|
MATHEMATICA
|
t[n_, m_] = If[m*(n - m) == 0, 1, Mod[Binomial[n, m], 2]*Prime[n] + (1 - Mod[Binomial[n, m], 2])*(Prime[n] + 1)]; Table[Table[t[n, m], {m, 0, n}], {n, 0, 10}]; Flatten[%]
|
|
CROSSREFS
|
Sequence in context: A147289 A147566 A146770 this_sequence A156050 A136489 A166455
Adjacent sequences: A143331 A143332 A143333 this_sequence A143335 A143336 A143337
|
|
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
|
