Triangle read by rows: T(n,k) = number of partitions of n with k circular successions (n>=0, 0 <= k <= n).

A250104

Triangle read by rows: T(n,k) = number of partitions of n with k circular successions (n>=0, 0 <= k <= n).

Terms

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

External references