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”).

A267333
Number of 4Xn arrays containing n copies of 0..4-1 with every element equal to or 1 greater than any southwest or northwest neighbors modulo 4 and the upper left element equal to 0.
1
6, 0, 0, 1, 22, 396, 2516, 10533, 33704, 92526, 369726, 2640466, 20643782, 138985920, 774999596, 3688265633, 16042197634, 71499663298, 364035498690, 2117882102632, 12817951753070, 74510126235424, 404088344721210, 2063669373837938
OFFSET
1,1
COMMENTS
Row 4 of A267328.
LINKS
EXAMPLE
Some solutions for n=6
..0..1..2..2..3..3....0..1..2..3..0..0....0..1..2..2..3..0....0..0..0..1..2..3
..0..1..1..2..3..0....0..1..2..3..3..0....1..1..2..3..3..0....3..0..1..1..2..3
..0..1..2..2..3..0....1..1..2..2..3..0....0..1..2..3..3..0....3..0..1..1..2..2
..1..1..2..3..3..0....1..1..2..2..3..3....1..1..2..2..3..0....3..0..1..2..2..3
CROSSREFS
Cf. A267328.
Sequence in context: A372047 A325740 A222118 * A337885 A333204 A186978
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jan 13 2016
STATUS
approved