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

%I

%S 1,0,8,376,40298,25499147,28504890050,49017350138134

%N 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.

%C Column 3 of A266921.

%e Some solutions for n=5

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

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

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

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

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

%Y Cf. A266921.

%K nonn

%O 1,3

%A _R. H. Hardin_, Jan 06 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 September 28 18:53 EDT 2022. Contains 357081 sequences. (Running on oeis4.)