login
A267658
Number of 6 X n arrays containing n copies of 0..6-1 with every element equal to or 1 greater than any north or southwest neighbors modulo 6 and the upper left element equal to 0.
0
1, 3, 17, 268, 4585, 55105, 569689, 7128794, 126811891, 2572337388, 46961006281, 747059584134, 11319499747995
OFFSET
1,2
COMMENTS
Row 6 of A267655.
EXAMPLE
Some solutions for n=6
..0..0..1..2..4..5....0..1..2..2..3..4....0..2..2..3..5..0....0..1..3..4..5..5
..0..1..1..3..4..5....0..1..2..3..4..5....1..2..3..4..5..1....0..2..3..4..5..0
..0..1..2..3..4..5....0..1..2..3..5..5....2..2..3..5..0..1....1..2..3..5..0..1
..0..1..2..3..4..5....0..2..3..4..5..0....2..3..4..5..0..1....1..3..4..5..0..1
..1..2..3..3..4..5....1..3..4..4..5..1....3..4..4..5..0..1....2..3..4..5..1..2
..2..2..3..4..5..0....2..3..4..5..0..1....3..4..4..5..0..1....3..4..4..0..2..2
CROSSREFS
Cf. A267655.
Sequence in context: A084040 A009495 A153487 * A365364 A374315 A155201
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jan 19 2016
STATUS
approved