login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A232539 Triangle read by rows: T(n,k) = number of partitions of n into at most four parts in which the largest part is equal to k, 0 <= k <= n. 1

%I

%S 1,0,1,0,1,1,0,1,1,1,0,1,2,1,1,0,0,2,2,1,1,0,0,2,3,2,1,1,0,0,1,3,3,2,

%T 1,1,0,0,1,3,4,3,2,1,1,0,0,0,3,4,4,3,2,1,1,0,0,0,2,5,5,4,3,2,1,1,0,0,

%U 0,1,4,6,5,4,3,2,1,1,0,0,0,1,4,6,7,5,4,3,2,1,1

%N Triangle read by rows: T(n,k) = number of partitions of n into at most four parts in which the largest part is equal to k, 0 <= k <= n.

%e Triangle T{n,k} begins:

%e 1;

%e 0, 1;

%e 0, 1, 1;

%e 0, 1, 1, 1;

%e 0, 1, 2, 1, 1;

%e 0, 0, 2, 2, 1, 1;

%e 0, 0, 2, 3, 2, 1, 1;

%e 0, 0, 1, 3, 3, 2, 1, 1;

%e 0, 0, 1, 3, 4, 3, 2, 1, 1;

%e 0, 0, 0, 3, 4, 4, 3, 2, 1, 1; ...

%Y Cf. A001400 (row sums), A219237, A233292 (row partial sums).

%K nonn,tabl

%O 0,13

%A _L. Edson Jeffery_, Jan 02 2014

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 April 5 17:03 EDT 2020. Contains 333245 sequences. (Running on oeis4.)