Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A107676
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A107676 Matrix cube of triangle A107671. +0
7
1, 56, 8, 7965, 513, 27, 2128064, 81856, 2368, 64, 914929500, 23846125, 469625, 7625, 125, 576689214816, 10943504136, 160767720, 1898856, 19656, 216, 500750172337212, 7250862593527, 83548607478, 776598305, 6081733, 43561, 343 (list; table; graph; listen)
OFFSET

0,2

COMMENT

Column 0 is A006690.

FORMULA

Matrix diagonalization method: define triangular matrix P by P(n, k) = ((n+1)^3)^(n-k)/(n-k)!, n>=k>=0 and diagonal matrix D(n, n) = n+1, then T is given by T = P^-1*D^3*P.

EXAMPLE

Triangle begins:

1;

56,8;

7965,513,27;

2128064,81856,2368,64;

914929500,23846125,469625,7625,125;

576689214816,10943504136,160767720,1898856,19656,216; ...

which equals the matrix cube of triangle A107671:

1;

8,2;

513,27,3;

81856,2368,64,4;

23846125,469625,7625,125,5;

10943504136,160767720,1898856,19656,216,6; ...

PROGRAM

(PARI) {T(n, k)=local(P=matrix(n+1, n+1, r, c, if(r>=c, (r^3)^(r-c)/(r-c)!)), D=matrix(n+1, n+1, r, c, if(r==c, r))); if(n>=k, (P^-1*D^3*P)[n+1, k+1])}

CROSSREFS

Cf. A107667, A107671, A107674, A006690.

Sequence in context: A093255 A115410 A036197 this_sequence A005932 A109737 A092077

Adjacent sequences: A107673 A107674 A107675 this_sequence A107677 A107678 A107679

KEYWORD

nonn,tabl

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Jun 07 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 23 10:40 EST 2009. Contains 167421 sequences.


AT&T Labs Research