This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A132289 Triangle, read by rows of 2n+1 terms, where T(n,k) = T(n,k-1) + T(n-1,k-1) for 2n>=k>0, T(n,2n-1) = T(n,2n-2) + T(n-1,n-1) and T(n,2n) = T(n,2n-1) + T(n-1,n-1) for n>0, with T(n,0) = T(n-1,n-1) for n>0 and T(0,0) = 1. 1
 1, 1, 2, 3, 3, 4, 6, 9, 12, 12, 15, 19, 25, 34, 46, 58, 58, 70, 85, 104, 129, 163, 209, 267, 325, 325, 383, 453, 538, 642, 771, 934, 1143, 1410, 1735, 2060, 2060, 2385, 2768, 3221, 3759, 4401, 5172, 6106, 7249, 8659, 10394, 12454, 14514, 14514, 16574, 18959 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS Column 0 and the rightmost border (shifted right) equal A125276. LINKS EXAMPLE Triangle begins: 1; 1, 2, 3; 3, 4, 6, 9, 12; 12, 15, 19, 25, 34, 46, 58; 58, 70, 85, 104, 129, 163, 209, 267, 325; 325, 383, 453, 538, 642, 771, 934, 1143, 1410, 1735, 2060; 2060, 2385, 2768, 3221, 3759, 4401, 5172, 6106, 7249, 8659, 10394, 12454, 14514; ... PROG (PARI) T(n, k)=local(A=1]); if(2*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 October 23 07:11 EDT 2019. Contains 328336 sequences. (Running on oeis4.)