|
Search: id:A143266
|
|
|
| A143266 |
|
A triangle sequence based on A091969 ( related to cyclic Gray Code): a(n,m,k) defined in A091969: t(n,m)=a(n, 2^(n - 1), 2^(m - 1)). |
|
+0
1
|
|
| 1, 1, 1, 0, 1, 1, 0, 1, 4, 4, 0, 0, 4, 28, 28, 0, 0, 0, 76, 550, 550, 0, 0, 0, 0, 4465, 28456, 28456, 0, 0, 0, 0, 1, 828038, 4134861, 4134861, 0, 0, 0, 0, 0, 4205, 473635054, 1781622569, 1781622569
(list; graph; listen)
|
|
|
OFFSET
|
1,9
|
|
|
COMMENT
|
Row sums are:
{1, 2, 2, 9, 60, 1176, 61377, 9097761, 4036884397}.
|
|
FORMULA
|
a(n,m,k) defined in A091969: t(n,m)=a(n, 2^(n - 1), 2^(m - 1)).
|
|
EXAMPLE
|
{1},
{1, 1},
{0, 1, 1},
{0, 1, 4, 4},
{0, 0, 4, 28, 28},
{0, 0, 0, 76, 550, 550},
{0, 0, 0, 0, 4465, 28456, 28456},
{0, 0, 0, 0, 1, 828038, 4134861, 4134861},
{0, 0, 0, 0, 0, 4205, 473635054, 1781622569, 1781622569}
|
|
MATHEMATICA
|
Clear[a, l, s, p, n]; a[1, s_, p_] := a[1, s, p] = If[1 <= s <= p, 1, 0]; a[n_, s_, p_] := a[n, s, p] = If[s < 2^(n - 1), 0, Sum[a[n - 1, s - k, Min[p, k]], {k, 1, Min[p, s]}]]; Table[Table[ a[n, 2^(n - 1), 2^(m - 1)], {m, 1, n}], {n, 1, 9}]; Flatten[%]
|
|
CROSSREFS
|
Cf. A091969.
Sequence in context: A002298 A069191 A098445 this_sequence A133845 A075866 A156450
Adjacent sequences: A143263 A143264 A143265 this_sequence A143267 A143268 A143269
|
|
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
|
