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.
%I A103286 #3 Mar 30 2012 18:36:45 %S A103286 1,1,2,2,2,5,4,5,6,12,8,12,14,17,30,16,30,32,40,48,77,32,76,77,94,112, %T A103286 136,202,64,184,202,230,265,318,384,540,128,432,540,588,662,760,901, %U A103286 1086,1464,256,992,1464,1512,1716,1912,2182,2562,3073,4014,512,2240 %N A103286 Triangle, read by rows, where row n+1 is formed by sorting, in ascending order, the result of the convolution of row n with {2,1}. %C A103286 Row sums are powers of 3. Main diagonal is A103287. %e A103286 Convolution of row 4 {4,5,6,12} with {2,1} = {8,14,17,30,12}; %e A103286 sort to obtain row 5: {8,12,14,17,30}. %e A103286 Rows begin: %e A103286 1, %e A103286 1,2, %e A103286 2,2,5, %e A103286 4,5,6,12, %e A103286 8,12,14,17,30, %e A103286 16,30,32,40,48,77, %e A103286 32,76,77,94,112,136,202, %e A103286 64,184,202,230,265,318,384,540, %e A103286 128,432,540,588,662,760,901,1086,1464, %e A103286 256,992,1464,1512,1716,1912,2182,2562,3073,4014,... %o A103286 (PARI) {T(n,k)=local(A=vector(n+1,i,vector(i)),B);A[1][1]=1; for(k=1,n,B=vector(k+1);B[1]=2*A[k][1];B[k+1]=A[k][k]; for(i=2,k,B[i]=2*A[k][i]+A[k][i-1]); A[k+1]=vecsort(B));return(A[n+1][k+1])} %Y A103286 Cf. A103287, A103284. %K A103286 nonn,tabl %O A103286 0,3 %A A103286 _Paul D. Hanna_, Jan 28 2005