login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A267657 Number of 5Xn arrays containing n copies of 0..5-1 with every element equal to or 1 greater than any north or southwest neighbors modulo 5 and the upper left element equal to 0. 0
1, 3, 21, 221, 1811, 13359, 129319, 1586523, 18730678, 199349073, 2099779009, 24121529923, 295646288820, 3584583743925, 42093020236586, 495027849517287, 6012600565537213, 74749463188676255 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Row 5 of A267655.
LINKS
EXAMPLE
Some solutions for n=7
..0..1..2..3..4..1..2....0..0..2..3..3..4..1....0..0..2..3..4..0..1
..1..2..3..4..0..1..3....0..1..3..3..4..0..1....0..1..3..4..0..1..1
..1..3..4..0..1..2..4....0..2..3..4..4..1..2....1..2..3..4..0..1..2
..2..3..0..0..2..3..4....1..2..3..4..0..1..3....2..3..4..4..0..2..2
..3..4..0..1..2..4..0....2..2..4..0..1..2..4....3..3..4..4..1..2..3
CROSSREFS
Cf. A267655.
Sequence in context: A218494 A099121 A107864 * A303057 A354263 A369795
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jan 19 2016
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 18:17 EDT 2024. Contains 371962 sequences. (Running on oeis4.)