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

A267203
Number of 5Xn arrays containing n copies of 0..5-1 with every element equal to or 1 greater than any north, southwest or northwest neighbors modulo 5 and the upper left element equal to 0.
0
1, 0, 0, 0, 1, 6, 47, 300, 1233, 3337, 7048, 15214, 43620, 224133, 1567797, 10356991, 58751450, 281746346, 1167238072, 4352934719, 15495243129, 57125652937, 236999679008, 1129723081249, 5822844270273
OFFSET
1,6
COMMENTS
Row 5 of A267197.
EXAMPLE
Some solutions for n=9
..0..1..1..2..2..3..3..4..4....0..1..1..1..2..2..3..4..4
..0..1..2..2..3..3..4..4..0....0..1..1..2..2..3..3..4..0
..0..1..2..2..3..3..4..0..0....0..1..1..2..3..3..4..4..0
..1..1..2..3..3..4..4..0..1....0..1..2..2..3..3..4..4..0
..1..2..2..3..4..4..0..0..1....0..1..2..2..3..3..4..4..0
CROSSREFS
Cf. A267197.
Sequence in context: A267233 A027012 A160609 * A353098 A024076 A015553
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jan 11 2016
STATUS
approved