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!)
A266903 Number of nX3 arrays containing 3 copies of 0..n-1 with no element 1 greater than its north, west or southwest neighbor modulo n and the upper left element equal to 0. 0
1, 0, 5, 102, 31550, 19336609, 21048933326, 36737059793206, 95191585228772333 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
Column 3 of A266904.
LINKS
EXAMPLE
Some solutions for n=5
..0..3..1....0..0..0....0..0..4....0..4..3....0..2..4....0..0..4....0..4..1
..4..3..0....2..2..2....3..2..4....4..3..1....4..1..3....3..0..2....2..2..1
..3..2..4....4..4..1....3..1..4....1..1..0....2..1..3....2..2..1....2..1..0
..0..2..1....1..3..3....2..0..2....3..0..4....1..3..0....4..1..3....4..3..0
..4..2..1....4..1..3....1..3..1....2..2..2....0..2..4....4..1..3....4..3..3
CROSSREFS
Cf. A266904.
Sequence in context: A123626 A210900 A197799 * A052138 A308459 A142418
KEYWORD
nonn
AUTHOR
R. H. Hardin, Jan 05 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 23 02:53 EDT 2024. Contains 371906 sequences. (Running on oeis4.)