A212536 T(n,k)=Number of nondecreasing sequences of n 1..k integers with every element dividing the sequence sum.
1, 2, 1, 3, 2, 1, 4, 3, 3, 1, 5, 4, 5, 3, 1, 6, 5, 7, 5, 4, 1, 7, 6, 8, 10, 8, 4, 1, 8, 7, 11, 12, 15, 8, 5, 1, 9, 8, 12, 17, 21, 15, 12, 5, 1, 10, 9, 14, 18, 30, 21, 24, 12, 6, 1, 11, 10, 16, 23, 33, 40, 33, 29, 16, 6, 1, 12, 11, 18, 26, 46, 44, 69, 40, 39, 16, 7, 1, 13, 12, 19, 30, 53, 64, 83, 91
Offset: 1
Examples
Some solutions for n=8 k=4 ..1....1....2....1....1....1....1....2....1....1....1....1....2....2....1....1 ..1....2....2....2....1....1....1....3....1....1....1....1....2....2....2....1 ..2....3....3....2....1....1....1....3....1....2....1....2....2....4....2....2 ..2....3....3....2....1....1....1....3....1....2....1....2....2....4....3....2 ..2....3....3....2....1....2....2....3....1....2....1....2....4....4....4....3 ..4....4....3....3....2....2....2....3....1....2....1....2....4....4....4....3 ..4....4....4....3....2....4....2....3....2....2....2....2....4....4....4....3 ..4....4....4....3....3....4....2....4....2....2....4....4....4....4....4....3
Links
- R. H. Hardin, Table of n, a(n) for n = 1..877
Comments