Triangle read by rows: T(n,k) = number of 2 X inf arrays [ n, n1, n2, ...; k, k1, k2,... ] with n>=n1>n2>...>=0, k>=k1>k2...>=0, n>k, n1>k1, ...; n >= 1, k >= 0. Note that once ni or ki = 0, the strict inequalities become equalities (constant 0 thereafter).

A039597

Triangle read by rows: T(n,k) = number of 2 X inf arrays [ n, n1, n2, ...; k, k1, k2,... ] with n>=n1>n2>...>=0, k>=k1>k2...>=0, n>k, n1>k1, ...; n >= 1, k >= 0. Note that once ni or ki = 0, the strict inequalities become equalities (constant 0 thereafter).

Terms

    a(0) =2a(1) =4a(2) =6a(3) =8a(4) =14a(5) =20a(6) =16a(7) =30a(8) =50a(9) =70a(10) =32a(11) =62a(12) =112a(13) =182a(14) =252a(15) =64a(16) =126a(17) =238a(18) =420a(19) =672a(20) =924a(21) =128a(22) =254a(23) =492a(24) =912a(25) =1584a(26) =2508a(27) =3432a(28) =256a(29) =510

External references