A102035 Carrie's triangle, read by rows, where the terms are generated by the rule: T(n,k) = T(n-1,k) + T(n-1,k-1) + T(n-2,k-1) + T(n-3,k-1) + T(n-3,k), with T(0,0)=1.
1, 1, 1, 1, 3, 1, 2, 6, 5, 1, 3, 11, 15, 7, 1, 4, 20, 36, 28, 9, 1, 6, 35, 78, 85, 45, 11, 1, 9, 59, 159, 221, 166, 66, 13, 1, 13, 98, 309, 522, 509, 287, 91, 15, 1, 19, 161, 579, 1153, 1382, 1018, 456, 120, 17, 1, 28, 261, 1056, 2421, 3444, 3141, 1840, 681, 153, 19, 1, 41, 419
Offset: 0
Examples
Generated by adding preceding terms in the triangle at positions that form the letter 'C': T(n,k) = T(n-3,k-1) + T(n-3,k) + T(n-2,k-1) + T(n-1,k-1) + T(n-1,k). Rows begin: [1], [1,1], [1,3,1], [2,6,5,1], [3,11,15,7,1], [4,20,36,28,9,1], [6,35,78,85,45,11,1], [9,59,159,221,166,66,13,1], [13,98,309,522,509,287,91,15,1], [19,161,579,1153,1382,1018,456,120,17,1],...
Programs
-
PARI
{T(n,k)=if(n
Formula
G.f.: A(x, y) = 1/(1-(1+y)*x-y*x^2-(1+y)*x^3).
Comments