Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A118024
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A118024 Triangle T, read by rows, T(n,k) = T(n-k)*2^(k*(n-k)) such that column 0 of the matrix square of T equals column 0 of T shifted left: [T^2](n,k) = T(n-k+1,0)*2^(k*(n-k)) for n>=k>=0. +0
3
1, 1, 1, 2, 2, 1, 6, 8, 4, 1, 28, 48, 32, 8, 1, 216, 448, 384, 128, 16, 1, 2864, 6912, 7168, 3072, 512, 32, 1, 66656, 183296, 221184, 114688, 24576, 2048, 64, 1, 2760896, 8531968, 11730944, 7077888, 1835008, 196608, 8192, 128, 1, 205824384, 706789376 (list; table; graph; listen)
OFFSET

0,4

COMMENT

Column 0 is A118025, where T(n,k) = A118025(n-k)*2^(k*(n-k)).

FORMULA

T(n,k) = A118025(n-k)*2^(k*(n-k)) for n>=k>=0.

EXAMPLE

Triangle T begins:

1;

1,1;

2,2,1;

6,8,4,1;

28,48,32,8,1;

216,448,384,128,16,1;

2864,6912,7168,3072,512,32,1;

66656,183296,221184,114688,24576,2048,64,1; ...

2760896,8531968,11730944,7077888,1835008,196608,8192,128,1; ...

Matrix square is given by [T^2](n,k) = T(n-k+1,0)*2^(k*(n-k)):

1;

2,1;

6,4,1;

28,24,8,1;

216,224,96,16,1;

2864,3456,1792,384,32,1; ...

so that column 0 of T^2 equals column 0 of T shift left 1 place.

PROGRAM

(PARI) {T(n, k)=if(n<0|k>n, 0, if(n==k, 1, 2^k*sum(j=0, n-1, T(n-1, j)*T(j, k)); ))} - Paul D. Hanna (pauldhanna(AT)juno.com), Sep 25 2006

CROSSREFS

Cf. A118025 (column 0); A117401 (related triangle); A118022 (variant).

Cf. A123305.

Sequence in context: A135880 A077873 A123305 this_sequence A074297 A020824 A138678

Adjacent sequences: A118021 A118022 A118023 this_sequence A118025 A118026 A118027

KEYWORD

nonn,tabl

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Apr 10 2006

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research