login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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}. 1

%I #3 Mar 30 2012 18:36:45

%S 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 136,202,64,184,202,230,265,318,384,540,128,432,540,588,662,760,901,

%U 1086,1464,256,992,1464,1512,1716,1912,2182,2562,3073,4014,512,2240

%N 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 Row sums are powers of 3. Main diagonal is A103287.

%e Convolution of row 4 {4,5,6,12} with {2,1} = {8,14,17,30,12};

%e sort to obtain row 5: {8,12,14,17,30}.

%e Rows begin:

%e 1,

%e 1,2,

%e 2,2,5,

%e 4,5,6,12,

%e 8,12,14,17,30,

%e 16,30,32,40,48,77,

%e 32,76,77,94,112,136,202,

%e 64,184,202,230,265,318,384,540,

%e 128,432,540,588,662,760,901,1086,1464,

%e 256,992,1464,1512,1716,1912,2182,2562,3073,4014,...

%o (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 Cf. A103287, A103284.

%K nonn,tabl

%O 0,3

%A _Paul D. Hanna_, Jan 28 2005

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 11 23:45 EDT 2024. Contains 375082 sequences. (Running on oeis4.)