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.

A113101 Triangle T, read by rows, equal to the matrix 4th power of triangle A113095, which satisfies the recurrence: A113095(n,k) = [A113095^4](n-1,k-1) + [A113095^4](n-1,k).

This page as a plain text file.
%I A113101 #5 Mar 14 2015 10:05:42
%S A113101 1,4,1,46,20,1,1504,894,84,1,146821,108292,14622,340,1,45236404,
%T A113101 39188597,6812596,233758,1364,1,46002427696,45157269264,9504275037,
%U A113101 428894516,3733278,5460,1,159443238441379,172969059719500
%N A113101 Triangle T, read by rows, equal to the matrix 4th power of triangle A113095, which satisfies the recurrence: A113095(n,k) = [A113095^4](n-1,k-1) + [A113095^4](n-1,k).
%C A113101 Column 0 equals A113096 shift left one place.
%e A113101 Triangle begins:
%e A113101 1;
%e A113101 4,1;
%e A113101 46,20,1;
%e A113101 1504,894,84,1;
%e A113101 146821,108292,14622,340,1;
%e A113101 45236404,39188597,6812596,233758,1364,1;
%e A113101 46002427696,45157269264,9504275037,428894516,3733278,5460,1;
%o A113101 (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^4)[r-1,c-1])+(M^4)[r-1,c]))); return((M^4)[n+1,k+1])}
%Y A113101 Cf. A113092 (table), A113096 (column 0).
%K A113101 nonn,tabl
%O A113101 0,2
%A A113101 _Paul D. Hanna_, Oct 14 2005