login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A115323 Triangle, read by rows, where row n+1 is formed by sorting, in ascending order, the result of the convolution of row n (consisting of 2n+1 terms) with [1,1,1]. 2
1, 1, 1, 1, 1, 1, 2, 2, 3, 1, 2, 3, 4, 5, 5, 7, 1, 3, 6, 7, 9, 12, 12, 14, 17, 1, 4, 10, 16, 17, 22, 28, 31, 33, 38, 43, 1, 5, 15, 30, 43, 43, 55, 67, 81, 81, 92, 102, 114, 1, 6, 21, 50, 88, 114, 116, 141, 165, 203, 216, 229, 254, 275, 308, 1, 7, 28, 77, 159, 252, 308, 318, 371, 422 (list; table; graph; refs; listen; history; text; internal format)
OFFSET

0,7

LINKS

Table of n, a(n) for n=0..73.

EXAMPLE

Convolution of [1,1,1] with row 3 gives:

[1,1,1]*[1,2,3,4,5,5,7] = [1,3,6,9,12,14,17,12,7];

when sorted yields row 4: [1,3,6,7,9,12,12,14,17].

Triangle begins:

1;

1,1,1;

1,1,2,2,3;

1,2,3,4,5,5,7;

1,3,6,7,9,12,12,14,17;

1,4,10,16,17,22,28,31,33,38,43;

1,5,15,30,43,43,55,67,81,81,92,102,114;

1,6,21,50,88,114,116,141,165,203,216,229,254,275,308;

1,7,28,77,159,252,308,318,371,422,509,583,584,648,699,758,837; ...

PROG

(PARI) T(n, k)=local(V); if(2*n<k || k<0, 0, if(k==0 || n==1, 1, V=vector(2*n+1); for(i=0, 2*n, V[i+1]=if(i-2>=0, T(n-1, i-2))+if(i>0, T(n-1, i-1))+T(n-1, i)); V=vecsort(V); V[k+1]))

CROSSREFS

Cf. A103284 (variant), A115324 (central terms), A115325 (diagonal).

Sequence in context: A182910 A055460 A067514 * A089282 A308640 A079688

Adjacent sequences:  A115320 A115321 A115322 * A115324 A115325 A115326

KEYWORD

nonn,tabl

AUTHOR

Paul D. Hanna, Jan 20 2006

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 15 02:19 EDT 2019. Contains 327062 sequences. (Running on oeis4.)