login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A136467 Triangle T, read by rows, where column 0 of T^m equals C(m*2^(n-1), n) as n=0,1,2,3,..., for all m. 9
1, 1, 1, 1, 4, 1, 4, 32, 16, 1, 70, 848, 576, 64, 1, 4368, 75648, 62208, 9216, 256, 1, 906192, 22313216, 21169152, 3792896, 143360, 1024, 1, 621216192, 21827627008, 23212261376, 4793434112, 223215616, 2228224, 4096, 1, 1429702652400 (list; table; graph; refs; listen; history; internal format)
OFFSET

0,5

COMMENTS

Column 0 of T^(n+1) = row n of square array A136462 defined by: A136462(n,k) = C((n+1)*2^(k-1), k); T^n denotes the n-th matrix power of this triangle T = A136467.

FORMULA

Diagonals: T(n+1,n) = 4^n; T(n+2,n) = (2^(n+1) + n-1)*8^n.

EXAMPLE

Triangle T begins:

1;

1, 1;

1, 4, 1;

4, 32, 16, 1;

70, 848, 576, 64, 1;

4368, 75648, 62208, 9216, 256, 1;

906192, 22313216, 21169152, 3792896, 143360, 1024, 1;

621216192, 21827627008, 23212261376, 4793434112, 223215616, 2228224, 4096, 1;

1429702652400, 71889350288384, 83889221697536, 19373156990976, 1055047811072, 13257146368, 34865152, 16384, 1; ...

Column 0 of T^m is given by: [T^m](n,0) = C(m*2^(n-1), n) for n>=0.

PROG

(PARI) {T(n, k)=local(M=matrix(n+1, n+1, r, c, binomial(r*2^(c-2), c-1)), P); P=matrix(n+1, n+1, r, c, binomial((r+1)*2^(c-2), c-1)); (P~*M~^-1)[n+1, k+1]}

CROSSREFS

Cf. columns: A136465, A136468, A136469; A136470 (matrix square); A136462.

Sequence in context: A143461 A066808 A033918 * A079188 A076810 A185373

Adjacent sequences:  A136464 A136465 A136466 * A136468 A136469 A136470

KEYWORD

nonn,tabl

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Dec 31 2007

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

Content is available under The OEIS End-User License Agreement .

Last modified February 15 23:53 EST 2012. Contains 205860 sequences.