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!)
A266920 Number of nX3 arrays containing 3 copies of 0..n-1 with no element 1 greater than its north, southwest or southeast neighbor modulo n and the upper left element equal to 0. 0
1, 0, 8, 376, 40298, 25499147, 28504890050, 49017350138134 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
Column 3 of A266921.
LINKS
EXAMPLE
Some solutions for n=5
..0..4..0....0..1..0....0..1..2....0..4..4....0..3..4....0..4..1....0..3..1
..4..1..2....4..0..4....4..3..2....0..2..4....4..2..3....4..2..1....3..2..0
..4..0..1....3..2..2....4..0..4....0..1..3....2..0..2....3..2..3....2..0..3
..3..2..3....3..4..2....1..0..2....2..3..1....1..3..0....0..1..3....2..4..1
..2..1..3....1..3..1....3..3..1....1..2..3....1..1..4....4..0..2....4..4..1
CROSSREFS
Cf. A266921.
Sequence in context: A221775 A206690 A349114 * A072447 A326877 A332138
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jan 06 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 August 14 05:41 EDT 2024. Contains 375146 sequences. (Running on oeis4.)