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.

A113110 Triangle T, read by rows, equal to the matrix cube of triangle A113106, which satisfies the recurrence: A113106(n,k) = [A113106^5](n-1,k-1) + [A113106^5](n-1,k).

This page as a plain text file.
%I A113110 #3 Mar 30 2012 18:36:51
%S A113110 1,3,1,33,18,1,1251,903,93,1,173505,151716,22278,468,1,94216515,
%T A113110 94758285,17789766,551778,2343,1,210576669921,235461277878,
%U A113110 53137278735,2167944516,13749903,11718,1,2002383115518243,2432344424403219
%N A113110 Triangle T, read by rows, equal to the matrix cube of triangle A113106, which satisfies the recurrence: A113106(n,k) = [A113106^5](n-1,k-1) + [A113106^5](n-1,k).
%e A113110 Triangle begins:
%e A113110 1;
%e A113110 3,1;
%e A113110 33,18,1;
%e A113110 1251,903,93,1;
%e A113110 173505,151716,22278,468,1;
%e A113110 94216515,94758285,17789766,551778,2343,1;
%e A113110 210576669921,235461277878,53137278735,2167944516,13749903,11718,1;
%o A113110 (PARI) {T(n,k)=local(M=matrix(n+1,n+1));for(r=1,n+1, for(c=1,r, M[r,c]=if(r==c,1,if(c>1,(M^5)[r-1,c-1])+(M^5)[r-1,c]))); return((M^3)[n+1,k+1])}
%Y A113110 Cf. A113106.
%K A113110 nonn,tabl
%O A113110 0,2
%A A113110 _Paul D. Hanna_, Oct 14 2005