A208727 T(n,k)=Number of 2n-bead necklaces labeled with numbers 1..k not allowing reversal, with neighbors differing by exactly 1.
0, 1, 0, 2, 1, 0, 3, 3, 1, 0, 4, 5, 4, 1, 0, 5, 7, 8, 6, 1, 0, 6, 9, 12, 15, 8, 1, 0, 7, 11, 16, 25, 27, 14, 1, 0, 8, 13, 20, 35, 52, 60, 20, 1, 0, 9, 15, 24, 45, 78, 131, 123, 36, 1, 0, 10, 17, 28, 55, 104, 210, 316, 285, 60, 1, 0, 11, 19, 32, 65, 130, 290, 551, 835, 648, 108, 1, 0, 12, 21, 36
Offset: 1
Examples
All solutions for n=5, k=3: ..2....1....1....1....1....1....1....1 ..3....2....2....2....2....2....2....2 ..2....3....1....1....1....3....1....1 ..3....2....2....2....2....2....2....2 ..2....1....1....3....1....3....3....1 ..3....2....2....2....2....2....2....2 ..2....3....1....3....3....3....1....1 ..3....2....2....2....2....2....2....2 ..2....3....3....3....3....3....3....1 ..3....2....2....2....2....2....2....2
Links
- R. H. Hardin, Table of n, a(n) for n = 1..183
Comments