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.

A113112 Triangle T, read by rows, equal to the matrix 4th power 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 A113112 #5 Mar 14 2015 10:05:56
%S A113112 1,4,1,56,24,1,2704,1576,124,1,481376,346624,39376,624,1,337587520,
%T A113112 284081376,41686624,979376,3124,1,978162377600,927672109184,
%U A113112 165184873376,5122890624,24434376,15624,1,12088945462984960
%N A113112 Triangle T, read by rows, equal to the matrix 4th power of triangle A113106, which satisfies the recurrence: A113106(n,k) = [A113106^5](n-1,k-1) + [A113106^5](n-1,k).
%e A113112 Triangle begins:
%e A113112 1;
%e A113112 4,1;
%e A113112 56,24,1;
%e A113112 2704,1576,124,1;
%e A113112 481376,346624,39376,624,1;
%e A113112 337587520,284081376,41686624,979376,3124,1;
%e A113112 978162377600,927672109184,165184873376,5122890624,24434376,15624,1;
%o A113112 (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^4)[n+1,k+1])}
%Y A113112 Cf. A113106, A113108, A113110.
%K A113112 nonn,tabl
%O A113112 0,2
%A A113112 _Paul D. Hanna_, Oct 14 2005