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.

A113088 Triangle T, read by rows, equal to the matrix square of triangle A113084, which satisfies the recurrence: A113084(n,k) = [A113084^3](n-1,k-1) + [A113084^3](n-1,k).

This page as a plain text file.
%I A113088 #3 Mar 30 2012 18:36:51
%S A113088 1,2,1,10,8,1,114,118,26,1,2970,3668,1108,80,1,182402,257122,96416,
%T A113088 9964,242,1,27392682,42821472,18871894,2501468,89182,728,1,
%U A113088 10390564242,17650889358,8826033518,1412198686,65914154,799714,2186,1
%N A113088 Triangle T, read by rows, equal to the matrix square of triangle A113084, which satisfies the recurrence: A113084(n,k) = [A113084^3](n-1,k-1) + [A113084^3](n-1,k).
%e A113088 Triangle begins:
%e A113088 1;
%e A113088 2,1;
%e A113088 10,8,1;
%e A113088 114,118,26,1;
%e A113088 2970,3668,1108,80,1;
%e A113088 182402,257122,96416,9964,242,1;
%e A113088 27392682,42821472,18871894,2501468,89182,728,1; ...
%o A113088 (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^3)[r-1,c-1])+(M^3)[r-1,c]))); return((M^2)[n+1,k+1])}
%Y A113088 Cf. A113084, A113081.
%K A113088 nonn,tabl
%O A113088 0,2
%A A113088 _Paul D. Hanna_, Oct 14 2005