Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A097084
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A097084 Triangle, read by rows, where the n-th diagonal equals the n-th row transformed by triangle A008459 (squared binomial coefficients). +0
2
1, 1, 1, 1, 2, 1, 1, 3, 5, 1, 1, 4, 10, 10, 1, 1, 5, 18, 28, 17, 1, 1, 6, 27, 74, 69, 26, 1, 1, 7, 39, 137, 245, 151, 37, 1, 1, 8, 52, 236, 586, 676, 298, 50, 1, 1, 9, 68, 372, 1194, 2126, 1634, 540, 65, 1, 1, 10, 85, 552, 2322, 5152, 6620, 3578, 913, 82, 1, 1, 11, 105, 777 (list; table; graph; listen)
OFFSET

0,5

COMMENT

Row sums form A097085.

FORMULA

T(n, k) = Sum_{j=0..k} T(n-k, j)*C(k, j)^2.

EXAMPLE

T(8,3) = 236 = (1)*1^2 + (5)*3^2 + (18)*3^2 + (28)*1^2

= Sum_{j=0..3} T(5,j)*C(3,j)^2.

Rows begin:

[1],

[1,1],

[1,2,1],

[1,3,5,1],

[1,4,10,10,1],

[1,5,18,28,17,1],

[1,6,27,74,69,26,1],

[1,7,39,137,245,151,37,1],

[1,8,52,236,586,676,298,50,1],...

PROGRAM

(PARI) T(n, k)=if(n<k|k<0, 0, if(n==k|k==0, 1, sum(j=0, n-k, T(n-k, j)*binomial(k, j)^2)))

CROSSREFS

Cf. A097085, A008459.

Adjacent sequences: A097081 A097082 A097083 this_sequence A097085 A097086 A097087

Sequence in context: A135722 A049513 A121207 this_sequence A094954 A083064 A112338

KEYWORD

nonn,tabl

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Jul 23 2004

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 May 15 13:16 EDT 2008. Contains 139641 sequences.


AT&T Labs Research