|
Search: id:A147649
|
|
|
| A147649 |
|
Binary prejudiced single Sierpinski modulo two Pascal shift: Prejudice function: p(n,m)=If[Mod[Binomial[n - 2, m - 1], 2] == 0, Round[Log[2]]/2, 1]; t(n,m)=Binomial[n, m] + If[n > 2, 2*Binomial[n - 2, m - 1]*p(n, m), 0]; Mod[If[n > 2, 2*Binomial[n - 2, m - 1]*p(n,m), 0],2]=0. |
|
+0
1
|
|
| 1, 1, 1, 1, 2, 1, 1, 5, 5, 1, 1, 6, 8, 6, 1, 1, 7, 16, 16, 7, 1, 1, 8, 19, 26, 19, 8, 1, 1, 9, 31, 45, 45, 31, 9, 1, 1, 10, 34, 86, 90, 86, 34, 10, 1, 1, 11, 50, 126, 196, 196, 126, 50, 11, 1, 1, 12, 53, 148, 266, 322, 266, 148, 53, 12, 1
(list; table; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
COMMENT
|
Row sums are:{1, 2, 4, 12, 22, 48, 82, 172, 352, 768, 1282,...}.
|
|
FORMULA
|
Prejudice function: p(n,m)=If[Mod[Binomial[n - 2, m - 1], 2] == 0, Round[Log[2]]/2, 1]; t(n,m)=Binomial[n, m] + If[n > 2, 2*Binomial[n - 2, m - 1]*p(n, m), 0].
|
|
EXAMPLE
|
{1}, {1, 1}, {1, 2, 1}, {1, 5, 5, 1}, {1, 6, 8, 6, 1}, {1, 7, 16, 16, 7, 1}, {1, 8, 19, 26, 19, 8, 1}, {1, 9, 31, 45, 45, 31, 9, 1}, {1, 10, 34, 86, 90, 86, 34, 10, 1}, {1, 11, 50, 126, 196, 196, 126, 50, 11, 1}, {1, 12, 53, 148, 266, 322, 266, 148, 53, 12, 1}
|
|
MATHEMATICA
|
p[n_, m_] := If[Mod[Binomial[n - 2, m - 1], 2] == 0, Round[Log[2]]/2, 1]; Table[Table[Binomial[n, m] + If[n > 2, 2*Binomial[n - 2, m - 1], 0], {m, 0, n}], {n, 0, 10}]; Flatten[%]
|
|
CROSSREFS
|
A146986, A146987, A028262
Sequence in context: A152924 A050145 A058676 this_sequence A147644 A158188 A128564
Adjacent sequences: A147646 A147647 A147648 this_sequence A147650 A147651 A147652
|
|
KEYWORD
|
nonn,tabl,uned
|
|
AUTHOR
|
Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Nov 09 2008
|
|
|
Search completed in 0.002 seconds
|
