The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A119329 Number triangle T(n,k)=sum{j=0..n-k, C(k,2j)C(n-k,2j)*2^j}. 2
 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 7, 7, 1, 1, 1, 1, 13, 19, 13, 1, 1, 1, 1, 21, 37, 37, 21, 1, 1, 1, 1, 31, 61, 77, 61, 31, 1, 1, 1, 1, 43, 91, 141, 141, 91, 43, 1, 1, 1, 1, 57, 127, 241, 301, 241, 127, 57, 1, 1 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 0,13 COMMENTS Row sums are A119330. Product of Pascal's triangle A007318 and A119331. T(n,k)=T(n,n-k). LINKS FORMULA Column k has g.f. (x^k/(1-x))*sum{j=0..k, C(k,2j)*2^j*(x/(1-x))^(2j)} EXAMPLE Triangle begins 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 7, 7, 1, 1, 1, 1, 13, 19, 13, 1, 1, 1, 1, 21, 37, 37, 21, 1, 1 CROSSREFS Cf. A119326. Sequence in context: A058663 A124371 A147989 * A054724 A061494 A141901 Adjacent sequences:  A119326 A119327 A119328 * A119330 A119331 A119332 KEYWORD easy,nonn,tabl AUTHOR Paul Barry, May 14 2006 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 27 08:31 EST 2020. Contains 331293 sequences. (Running on oeis4.)