Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A119468
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A119468 Number triangle T(n,k)=sum{j=0..n-k, C(n,2j)*C(n-2j,k)}. +0
3
1, 1, 1, 2, 2, 1, 4, 6, 3, 1, 8, 16, 12, 4, 1, 16, 40, 40, 20, 5, 1, 32, 96, 120, 80, 30, 6, 1, 64, 224, 336, 280, 140, 42, 7, 1, 128, 512, 896, 896, 560, 224, 56, 8, 1, 256, 1152, 2304, 2688, 2016, 1008, 336, 72, 9, 1, 512, 2560, 5760, 7680, 6720, 4032, 1680, 480, 90, 10 (list; table; graph; listen)
OFFSET

0,4

COMMENT

Product of Pascal's triangle A007318 and A119467. Row sums are A007051. Diagonal sums are A113225.

FORMULA

G.f.: (1-x-xy)/(1-2x-2x*y+2x^2*y+x^2*y^2); Number triangle T(n,k)=sum{j=0..n, C(n,j)*C(j,k)*(1+(-1)^(j-k))/2}.

EXAMPLE

Triangle begins

1,

1,1,

2,2,1,

4,6,3,1,

8,16,12,4,1,

16,40,40,20,5,1

CROSSREFS

Adjacent sequences: A119465 A119466 A119467 this_sequence A119469 A119470 A119471

Sequence in context: A121484 A080928 A068957 this_sequence A091869 A112307 A111062

KEYWORD

easy,nonn,tabl

AUTHOR

Paul Barry (pbarry(AT)wit.ie), May 21 2006

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 October 13 17:46 EDT 2008. Contains 145008 sequences.


AT&T Labs Research