The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A266885 Number of nX3 arrays containing 3 copies of 0..n-1 with no element 1 greater than its north, northeast or northwest neighbor modulo n and the upper left element equal to 0. 0

%I #4 Aug 12 2016 07:05:18

%S 1,0,1,322,52149,33089774,32230426133,53280974043650

%N Number of nX3 arrays containing 3 copies of 0..n-1 with no element 1 greater than its north, northeast or northwest neighbor modulo n and the upper left element equal to 0.

%C Column 3 of A266886.

%e Some solutions for n=5

%e ..0..0..0....0..0..4....0..4..0....0..0..4....0..2..1....0..0..0....0..4..0

%e ..2..3..2....3..2..3....2..3..2....2..3..3....4..4..1....2..3..3....3..3..2

%e ..1..1..2....1..2..1....1..1..2....1..2..1....4..3..1....2..2..1....0..2..2

%e ..4..4..4....0..4..1....4..1..0....4..4..0....2..3..3....4..4..1....4..4..1

%e ..3..1..3....2..4..3....4..3..3....1..3..2....0..2..0....1..4..3....1..3..1

%Y Cf. A266886.

%K nonn

%O 1,4

%A _R. H. Hardin_, Jan 05 2016

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 May 31 23:52 EDT 2024. Contains 373008 sequences. (Running on oeis4.)