Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A124574
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A124574 Triangle read by rows: row n is the 1st row of the matrix M[n]^(n-1), where M[n] is the n X n tridiagonal matrix with main diagonal (3,4,4,...) and super- and subdiagonals (1,1,1,...). +0
25
1, 3, 1, 10, 7, 1, 37, 39, 11, 1, 150, 204, 84, 15, 1, 654, 1050, 555, 145, 19, 1, 3012, 5409, 3415, 1154, 222, 23, 1, 14445, 28063, 20223, 8253, 2065, 315, 27, 1, 71398, 146920, 117208, 55300, 16828, 3352, 424, 31, 1, 361114, 776286, 671052, 355236 (list; table; graph; listen)
OFFSET

1,2

COMMENT

Column 1 yields A064613 (2nd binomial transform of the Catalan sequence A000108). Row sums yield A081671.

Triangle T(n,k), 0<=k<=n, defined by : T(0,0)=1, T(n,k)=0 if k<0 or if k>n, T(n,0)=3*T(n-1,0)+T(n-1,1), T(n,k)=T(n-1,k-1)+4*T(n-1,k)+T(n-1,k+1) . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Feb 27 2007

Triangle T(n,k), 0<=k<=n, read by rows given by : T(0,0)=1, T(n,k)=0 if k<0 or if k>n, T(n,0)=3*T(n-1,0)+T(n-1,1), T(n,k)=T(n-1,k-1)+4*T(n-1,k)+T(n-1,k+1) for k>=1 . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Mar 27 2007

This triangle belongs to the family of triangles defined by: T(0,0)=1, T(n,k)=0 if k<0 or if k>n, T(n,0)=x*T(n-1,0)+T(n-1,1), T(n,k)=T(n-1,k-1)+y*T(n-1,k)+T(n-1,k+1) for k>=1 . Other triangles arise by choosing different values for (x,y): (0,0) -> A053121; (0,1) -> A089942; (0,2) -> A126093; (0,3) -> A126970; (1,0)-> A061554; (1,1) -> A064189; (1,2) -> A039599; (1,3) -> A110877; ((1,4) -> A124576; (2,0) -> A126075; (2,1) -> A038622; (2,2) -> A039598; (2,3) -> A124733; (2,4) -> A124575; (3,0) -> A126953; (3,1) -> A126954; (3,2) -> A111418; (3,3) -> A091965; (3,4) -> A124574; (4,3) -> A126791; (4,4) -> A052179; (4,5) -> A126331; (5,5) -> A125906 . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Sep 25 2007

FORMULA

Sum_{k, 0<=k<=n}(-1)^(n-k)*T(n,k)=(-2)^n . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Feb 27 2007

Sum_{k, 0<=k<=n}T(n,k)*(2*k+1)=6^n . - Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Mar 27 2007

EXAMPLE

Row 4 is (37,39,11,1) because M[4]= [3,1,0,0;1,4,1,0;0,1,4,1;0,0,1,4] and M[4]^3=[37,39,11,1; 39, 87, 51, 12; 11, 51, 88, 50; 1, 12, 50, 76].

Triangle starts:

1;

3, 1

10, 7, 1;

37, 39, 11, 1

150, 204, 84, 15, 1;

654, 1050, 555, 145, 19, 1;

MAPLE

with(linalg): m:=proc(i, j) if i=1 and j=1 then 3 elif i=j then 4 elif abs(i-j)=1 then 1 else 0 fi end: for n from 3 to 11 do A[n]:=matrix(n, n, m): B[n]:=multiply(seq(A[n], i=1..n-1)) od: 1; 3, 1; for n from 3 to 11 do seq(B[n][1, j], j=1..n) od; # yields sequence in triangular form

CROSSREFS

Cf. A000108, A081671, A124575, A124576, A052179.

Cf. A064613.

Adjacent sequences: A124571 A124572 A124573 this_sequence A124575 A124576 A124577

Sequence in context: A116384 A117207 A046658 this_sequence A052964 A084178 A068438

KEYWORD

nonn,tabl

AUTHOR

Gary W. Adamson & Roger L. Bagula (qntmpkt(AT)yahoo.com), Nov 04 2006

EXTENSIONS

Edited by njas, Dec 044 2006

page 1

Search completed in 0.003 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 May 22 15:55 EDT 2008. Contains 140006 sequences.


AT&T Labs Research