Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A114151
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A114151 Triangle, read by rows, given by the product R^-2*Q^3 = Q^-1*P^2 using triangular matrices P=A113370, Q=A113381, R=A113389. +0
10
1, 0, 1, 0, 3, 1, 0, 15, 6, 1, 0, 136, 66, 9, 1, 0, 1998, 1091, 153, 12, 1, 0, 41973, 24891, 3621, 276, 15, 1, 0, 1166263, 737061, 110637, 8482, 435, 18, 1, 0, 40747561, 27110418, 4176549, 323874, 16430, 630, 21, 1 (list; table; graph; listen)
OFFSET

0,5

COMMENT

Complementary to A114150, which gives R^2*Q^-1 = Q^3*P^-2.

EXAMPLE

Triangle R^-2*Q^3 = Q^-1*P^2 begins:

1;

0,1;

0,3,1;

0,15,6,1;

0,136,66,9,1;

0,1998,1091,153,12,1;

0,41973,24891,3621,276,15,1; ...

Compare to R (A113389):

1;

3,1;

15,6,1;

136,66,9,1;

1998,1091,153,12,1;

41973,24891,3621,276,15,1; ...

Thus R^-2*Q^3 = Q^-1*P^2 equals R shift right one column.

PROGRAM

(PARI) {T(n, k)=local(P, Q, R, W); P=Mat(1); for(m=2, n+1, W=matrix(m, m); for(i=1, m, for(j=1, i, if(i<3|j==i|j>m-1, W[i, j]=1, if(j==1, W[i, 1]=1, W[i, j]=(P^(3*j-2))[i-j+1, 1])); )); P=W); Q=matrix(#P, #P, r, c, if(r>=c, (P^(3*c-1))[r-c+1, 1])); R=matrix(#P, #P, r, c, if(r>=c, (P^(3*c))[r-c+1, 1])); (Q^-1*P^2)[n+1, k+1]}

CROSSREFS

Cf. A113370 (P), A113381 (Q), A113389 (R); A114150 (R^2*Q^-1=Q^3*P^-2), A114152 (R^3*P^-1), A114153 (R^-1*P^3), A114154 (R^3*Q^-2), A114155 (Q^-2*P^3); A114156 (P^-1), A114158 (Q^-1), A114159 (R^-1).

Sequence in context: A067176 A137431 A131222 this_sequence A147723 A110518 A006837

Adjacent sequences: A114148 A114149 A114150 this_sequence A114152 A114153 A114154

KEYWORD

nonn,tabl

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Nov 15 2005

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 14:50 EST 2009. Contains 167570 sequences.


AT&T Labs Research