Triangle of numbers a(n,k) = number of partitions of k such that k = n + n_1 + n_2 + ... + n_t where n_1 <= 2n and n_{i+1} <= 2n_i for all i.

A047913

Triangle of numbers a(n,k) = number of partitions of k such that k = n + n_1 + n_2 + ... + n_t where n_1 <= 2n and n_{i+1} <= 2n_i for all i.

Terms

    a(0) =1a(1) =1a(2) =1a(3) =1a(4) =1a(5) =2a(6) =1a(7) =1a(8) =2a(9) =3a(10) =1a(11) =1a(12) =2a(13) =4a(14) =5a(15) =1a(16) =1a(17) =2a(18) =4a(19) =7a(20) =9a(21) =1a(22) =1a(23) =2a(24) =4a(25) =7a(26) =12a(27) =16a(28) =1a(29) =1

External references