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
 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; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,9 COMMENTS Row sums are: 1, 2, 2, 9, 60, 1176, 61377, 9097761, 4036884397 ... . LINKS FORMULA With 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: A200515 A200505 A285242 * A133845 A282289 A291696 Adjacent sequences:  A143263 A143264 A143265 * A143267 A143268 A143269 KEYWORD nonn,tabl AUTHOR Roger L. Bagula and Gary W. Adamson, Oct 21 2008 EXTENSIONS Edited by Michel Marcus and Joerg Arndt, Apr 22 2013 STATUS approved

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 October 17 14:56 EDT 2018. Contains 316282 sequences. (Running on oeis4.)