A254218 T(n,k) = number of length n 1..(k+2) arrays with no leading or trailing partial sum equal to a prime and no consecutive values equal.
1, 2, 0, 2, 0, 0, 3, 0, 1, 0, 3, 2, 3, 2, 1, 4, 2, 11, 4, 2, 0, 5, 8, 12, 22, 8, 2, 0, 6, 12, 32, 24, 56, 6, 2, 0, 6, 18, 48, 96, 70, 136, 15, 2, 0, 7, 18, 86, 168, 373, 192, 383, 18, 5, 0, 7, 28, 98, 388, 766, 1472, 633, 1070, 45, 4, 0, 8, 28, 172, 490, 2056, 3720, 6490, 2484, 3897
Offset: 1
Examples
Some solutions for n=4 k=4 ..4....4....4....1....1....1....1....6....6....6....1....6....4....4....4....6 ..6....2....2....3....5....5....5....3....3....4....5....2....2....5....6....4 ..4....4....3....2....6....3....4....5....5....2....3....4....6....3....2....2 ..6....6....1....4....4....6....6....1....4....4....1....6....4....6....4....6
Links
- R. H. Hardin, Table of n, a(n) for n = 1..265
Comments