login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A268095
Number of 3Xn 0..2 arrays with every repeated value in every row not one larger and in every column one larger mod 3 than the previous repeated value, and upper left element zero.
1
8, 192, 4608, 98830, 2028304, 40109966, 774613334, 14704721628, 275789779530, 5127593717314, 94736825794120, 1742377742866910, 31939206633903848, 584056036861579428, 10661467774391724330, 194364960910265681074
OFFSET
1,1
COMMENTS
Row 3 of A268092.
LINKS
EXAMPLE
Some solutions for n=4
..0..2..1..0....0..2..0..2....0..2..0..2....0..1..2..1....0..2..0..0
..2..2..2..2....2..0..2..0....0..0..0..0....0..0..0..2....2..1..2..2
..0..1..0..0....2..1..0..2....1..1..2..1....2..2..2..2....1..1..1..1
CROSSREFS
Cf. A268092.
Sequence in context: A267948 A339487 A189537 * A058873 A052734 A003435
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jan 26 2016
STATUS
approved