A215190 T(n,k)=Number of arrays of n 0..k integers with no sum of consecutive elements equal to a disjoint adjacent sum of an equal number of elements.
2, 3, 2, 4, 6, 2, 5, 12, 12, 0, 6, 20, 36, 18, 0, 7, 30, 80, 88, 30, 0, 8, 42, 150, 276, 216, 30, 0, 9, 56, 252, 664, 954, 440, 18, 0, 10, 72, 392, 1366, 2940, 2898, 896, 0, 0, 11, 90, 576, 2512, 7404, 11756, 8808, 1626, 0, 0, 12, 110, 810, 4264, 16092, 36864, 46972, 24014
Offset: 1
Examples
Some solutions for n=6 k=4 ..1....4....0....0....0....0....4....3....0....3....1....4....3....3....1....2 ..3....3....3....3....4....4....2....4....3....0....3....2....0....4....0....3 ..2....2....4....0....0....3....0....0....1....4....1....4....2....2....3....0 ..0....1....3....4....2....2....4....2....4....3....2....3....4....0....4....4 ..4....2....0....2....0....4....3....3....3....0....1....4....0....3....1....0 ..3....0....1....3....4....2....4....4....1....2....4....1....3....2....4....3
Links
- R. H. Hardin, Table of n, a(n) for n = 1..164
Comments