This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A129577 Triangle, read by rows, defined by T(n,k) = T(n-1,k) + T(n,k-1) for nk>0, where T(n,0) = T(n-1,0) + T(n-1,n-1) and T(n,n) = T(n,n-1) for n>0 with T(0,0)=1. 3
 1, 1, 1, 2, 3, 3, 5, 8, 11, 11, 16, 24, 35, 46, 46, 62, 86, 121, 167, 213, 213, 275, 361, 482, 649, 862, 1075, 1075, 1350, 1711, 2193, 2842, 3704, 4779, 5854, 5854, 7204, 8915, 11108, 13950, 17654, 22433, 28287, 34141, 34141, 41345, 50260, 61368, 75318 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 LINKS EXAMPLE Triangle begins: 1; 1, 1; 2, 3, 3; 5, 8, 11, 11; 16, 24, 35, 46, 46; 62, 86, 121, 167, 213, 213; 275, 361, 482, 649, 862, 1075, 1075; 1350, 1711, 2193, 2842, 3704, 4779, 5854, 5854; 7204, 8915, 11108, 13950, 17654, 22433, 28287, 34141, 34141; ... 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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.