A250164 Number of length n+1 0..5 arrays with the sum of adjacent differences multiplied by some arrangement of +-1 equal to zero.
6, 48, 380, 2860, 19896, 129648, 810964, 4962056, 30034672, 180893724, 1087112084, 6527090276, 39173693352, 235070531992, 1410496377492, 8463170413616, 50779536937024, 304678626418660, 1828075665965204, 10968465043204908
Offset: 1
Keywords
Examples
Some solutions for n=6 ..3....0....3....4....4....1....0....3....3....4....3....1....4....3....1....3 ..2....2....2....0....5....1....0....4....5....0....3....4....0....0....4....5 ..1....5....1....0....4....2....4....0....1....0....3....3....2....2....3....0 ..1....0....0....4....4....4....1....5....4....3....3....0....4....0....5....4 ..2....4....1....3....2....0....5....5....5....5....4....3....4....1....1....2 ..5....3....3....0....0....1....3....2....3....2....5....3....5....0....2....3 ..1....4....1....4....2....3....2....3....5....2....3....1....0....1....1....1
Links
- R. H. Hardin, Table of n, a(n) for n = 1..27
Comments