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

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A096815 Triangle, read by rows, such that T(n,k) equals the k-th term of the convolution of the two prior rows indexed by (n-k) and k. 5
 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 3, 1, 1, 1, 4, 4, 4, 1, 1, 1, 5, 6, 7, 5, 1, 1, 1, 6, 9, 11, 9, 6, 1, 1, 1, 7, 11, 17, 17, 13, 7, 1, 1, 1, 8, 14, 24, 30, 26, 16, 8, 1, 1, 1, 9, 18, 32, 42, 50, 36, 21, 9, 1, 1, 1, 10, 21, 42, 61, 79, 76, 51, 25, 10, 1, 1, 1, 11, 25, 53, 85, 118, 129, 115, 67 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 0,9 COMMENTS Row sums are A096816. LINKS FORMULA T(n, k) = Sum_{j=0..min(n-k, k)} T(n-k, j)*T(k, k-j), for n>=k>=1, with T(n, 0)=T(n+1, 1)=T(n, n)=1 for n>=0. EXAMPLE T(7,4) = 11 = 4th term of the convolution of row (7-4) and row 4: T(3,0)*T(4,4) + T(3,1)*T(4,3) + T(3,2)*T(4,2) + T(3,3)*T(4,1). Rows begin: [1], [1,1], [1,1,1], [1,1,2,1], [1,1,3,3,1], [1,1,4,4,4,1], [1,1,5,6,7,5,1], [1,1,6,9,11,9,6,1], [1,1,7,11,17,17,13,7,1], [1,1,8,14,24,30,26,16,8,1], [1,1,9,18,32,42,50,36,21,9,1], [1,1,10,21,42,61,79,76,51,25,10,1], [1,1,11,25,53,85,118,129,115,67,31,11,1],... PROG (PARI) T(n, k)=if(n

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 December 4 09:05 EST 2020. Contains 338921 sequences. (Running on oeis4.)