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.

A113108 Triangle T, read by rows, equal to the matrix square 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 A113108 #3 Mar 30 2012 18:36:51
%S A113108 1,2,1,16,12,1,440,416,62,1,43600,48320,10016,312,1,16698560,20765520,
%T A113108 5394320,246016,1562,1,26098464448,35382716032,10854556720,646408320,
%U A113108 6116016,7812,1,172513149018752,250136469031744,87213434633152
%N A113108 Triangle T, read by rows, equal to the matrix square of triangle A113106, which satisfies the recurrence: A113106(n,k) = [A113106^5](n-1,k-1) + [A113106^5](n-1,k).
%e A113108 Triangle begins:
%e A113108 1;
%e A113108 2,1;
%e A113108 16,12,1;
%e A113108 440,416,62,1;
%e A113108 43600,48320,10016,312,1;
%e A113108 16698560,20765520,5394320,246016,1562,1;
%e A113108 26098464448,35382716032,10854556720,646408320,6116016,7812,1; ...
%o A113108 (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^2)[n+1,k+1])}
%Y A113108 Cf. A113106.
%K A113108 nonn,tabl
%O A113108 0,2
%A A113108 _Paul D. Hanna_, Oct 14 2005