A212868 Rectangular array T(n,k) = number of nondecreasing sequences of n 1..k integers with no element dividing the sequence sum (for n, k >= 1), read by decreasing antidiagonals.
0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 2, 1, 0, 0, 0, 5, 3, 1, 0, 0, 0, 7, 9, 5, 2, 0, 0, 0, 12, 16, 15, 6, 2, 0, 0, 0, 16, 29, 29, 22, 9, 2, 0, 0, 0, 22, 43, 59, 52, 32, 12, 3, 0, 0, 0, 28, 64, 103, 112, 82, 40, 15, 3, 0, 0, 0, 37, 92, 168, 212, 199, 122, 59, 17, 3, 0, 0, 0, 43, 127, 259, 376, 407
Offset: 1
Examples
All solutions for n=8 and k=4: 2 2 2 3 3 2 2 2 2 3 2 2 2 3 2 2 3 2 4 3 2 2 2 2 3 2 2 3 3 3 2 3 3 4 3 2 3 2 2 3 2 2 3 3 4 2 3 3 4 4 2 3 3 2 3 3 2 3 3 4 2 3 3 4 4 2 3 3 2 3 4 3 3 3 4 3 3 4 4 4 2 3 3 2 3 4 4 3 3 4 3 3 4 4 4 2 3 4 3 4 4 4 4 3 4 3 3 4 4 4 3 4 4 4 4 4 4 4 4 4
Links
- R. H. Hardin, Table of n, a(n) for n = 1..958
Comments