This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A143266 Triangle read by rows: with a(n,m,k) defined in A091969: T(n,m)=a(n, 2^(n - 1), 2^(m - 1)). 0

%I

%S 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,

%T 28456,0,0,0,0,1,828038,4134861,4134861,0,0,0,0,0,4205,473635054,

%U 1781622569,1781622569

%N Triangle read by rows: with a(n,m,k) defined in A091969: T(n,m)=a(n, 2^(n - 1), 2^(m - 1)).

%C Row sums are: 1, 2, 2, 9, 60, 1176, 61377, 9097761, 4036884397 ... .

%F With a(n,m,k) defined in A091969: T(n,m)=a(n, 2^(n - 1), 2^(m - 1)).

%e {1},

%e {1, 1},

%e {0, 1, 1},

%e {0, 1, 4, 4},

%e {0, 0, 4, 28, 28},

%e {0, 0, 0, 76, 550, 550},

%e {0, 0, 0, 0, 4465, 28456, 28456},

%e {0, 0, 0, 0, 1, 828038, 4134861, 4134861},

%e {0, 0, 0, 0, 0, 4205, 473635054, 1781622569, 1781622569}

%t 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[%]

%Y Cf. A091969.

%K nonn,tabl

%O 1,9

%A _Roger L. Bagula_ and _Gary W. Adamson_, Oct 21 2008

%E Edited by _Michel Marcus_ and _Joerg Arndt_, Apr 22 2013

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 14 03:52 EST 2018. Contains 317159 sequences. (Running on oeis4.)