cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

This page as a plain text file.
%I A102035 #9 Jul 19 2024 19:04:53
%S A102035 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,
%T A102035 59,159,221,166,66,13,1,13,98,309,522,509,287,91,15,1,19,161,579,1153,
%U A102035 1382,1018,456,120,17,1,28,261,1056,2421,3444,3141,1840,681,153,19,1,41,419
%N 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.
%C A102035 Column 0 forms A000930. Row sums form A077938. This table was created by Carrie Hanna.
%F A102035 G.f.: A(x, y) = 1/(1-(1+y)*x-y*x^2-(1+y)*x^3).
%e A102035 Generated by adding preceding terms in the triangle
%e A102035 at positions that form the letter 'C': T(n,k) =
%e A102035 T(n-3,k-1) + T(n-3,k) +
%e A102035 T(n-2,k-1) +
%e A102035 T(n-1,k-1) + T(n-1,k).
%e A102035 Rows begin:
%e A102035 [1],
%e A102035 [1,1],
%e A102035 [1,3,1],
%e A102035 [2,6,5,1],
%e A102035 [3,11,15,7,1],
%e A102035 [4,20,36,28,9,1],
%e A102035 [6,35,78,85,45,11,1],
%e A102035 [9,59,159,221,166,66,13,1],
%e A102035 [13,98,309,522,509,287,91,15,1],
%e A102035 [19,161,579,1153,1382,1018,456,120,17,1],...
%o A102035 (PARI) {T(n,k)=if(n<k||k<0,0,if(n==0,1, T(n-1,k)+T(n-1,k-1)+T(n-2,k-1)+T(n-3,k-1)+T(n-3,k)))}
%Y A102035 Cf. A000930, A077938.
%K A102035 nonn,tabl
%O A102035 0,5
%A A102035 _Paul D. Hanna_, Dec 24 2004