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.

A113099 Triangle T, read by rows, equal to the matrix cube 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 A113099 #3 Mar 30 2012 18:36:51
%S A113099 1,3,1,27,15,1,693,513,63,1,52812,47619,8289,255,1,12628008,13176189,
%T A113099 2920527,131841,1023,1,9924266772,11586274263,3078907929,181929087,
%U A113099 2101761,4095,1,26507035453923,33825995695125,10365262415703
%N A113099 Triangle T, read by rows, equal to the matrix cube of triangle A113095, which satisfies the recurrence: A113095(n,k) = [A113095^4](n-1,k-1) + [A113095^4](n-1,k).
%e A113099 Triangle begins:
%e A113099 1;
%e A113099 3,1;
%e A113099 27,15,1;
%e A113099 693,513,63,1;
%e A113099 52812,47619,8289,255,1;
%e A113099 12628008,13176189,2920527,131841,1023,1;
%e A113099 9924266772,11586274263,3078907929,181929087,2101761,4095,1; ...
%o A113099 (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^3)[n+1,k+1])}
%Y A113099 Cf. A113095, A113098, A113101.
%K A113099 nonn,tabl
%O A113099 0,2
%A A113099 _Paul D. Hanna_, Oct 14 2005