Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A078121
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A078121 Infinite lower triangular matrix, M, that satisfies [M^2](i,j) = M(i+1,j+1) for all i,j>=0 where [M^n](i,j) denotes the element at row i, column j, of the n-th power of matrix M, with M(0,k)=1 and M(k,k)=1 for all k>=0. +0
24
1, 1, 1, 1, 2, 1, 1, 4, 4, 1, 1, 10, 16, 8, 1, 1, 36, 84, 64, 16, 1, 1, 202, 656, 680, 256, 32, 1, 1, 1828, 8148, 10816, 5456, 1024, 64, 1, 1, 27338, 167568, 274856, 174336, 43680, 4096, 128, 1, 1, 692004, 5866452, 11622976, 8909648, 2794496, 349504 (list; table; graph; listen)
OFFSET

0,5

COMMENT

M also satisfies: [M^(2k)](i,j) = [M^k](i+1,j+1) for all i,j,k>=0; thus [M^(2^n)](i,j) = M(i+n,j+n) for all n>=0.

FORMULA

M(1, j)=A002577(j) (partitions of 2^j into powers of 2), M(j+1, j)=2^j, M(j+2, j)=4^j, M(j+3, j)=A016131(j).

M(n, k) = the coefficient of x^(2^n - 2^(n-k)) in the power series expansion of 1/Product_{j=0..n-k}(1-x^(2^j)) whenever 0<=k<n for all n>0 (conjecture).

EXAMPLE

The square of the matrix is the same matrix excluding the first row and column:

[1,_0,_0,0,0]^2=[_1,_0,_0,_0,0]

[1,_1,_0,0,0]___[_2,_1,_0,_0,0]

[1,_2,_1,0,0]___[_4,_4,_1,_0,0]

[1,_4,_4,1,0]___[10,16,_8,_1,0]

[1,10,16,8,1]___[36,84,64,16,1]

CROSSREFS

Cf. A078122, A002577, A016131.

Sequence in context: A034372 A155971 A154218 this_sequence A119732 A123521 A123246

Adjacent sequences: A078118 A078119 A078120 this_sequence A078122 A078123 A078124

KEYWORD

nonn,tabl

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Nov 18 2002

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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research