A183727 1/12 the number of (n+1) X 8 0..5 arrays with every 2 X 2 subblock strictly increasing clockwise or counterclockwise with one decrease, and at least two adjacent blocks having the same increasing direction.
16731, 388998, 8439116, 200260149, 4858574535, 134020420595, 5585215240568, 460509744129719, 54842127230404464, 7095042727449540024, 920742012786042810982, 118354309394343482912431
Offset: 1
Keywords
Examples
Some solutions with the first block increasing clockwise for 3 X 8: ..1..2..1..3..2..1..3..2....1..2..1..0..2..1..2..1....1..2..1..2..1..2..1..0 ..0..5..0..4..5..0..4..0....0..3..4..5..4..5..4..0....0..4..5..4..5..3..4..5 ..1..3..2..3..2..1..3..1....1..2..1..0..3..2..3..2....2..3..1..3..1..2..1..0 ... ...R..L..R..L..L..R..L.......R..L..L..R..L..R..L.......R..L..R..L..R..L..L... ...L..R..L..R..R..L..R.......L..R..R..L..R..L..R.......L..R..L..R..L..R..R...
Links
- R. H. Hardin, Table of n, a(n) for n = 1..18
Comments