cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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

This page as a plain text file.
%I A266571 #4 Aug 12 2016 07:05:17
%S A266571 1,1,15,2320,729874,466056593,515679132204,897699718056452
%N A266571 Number of nX3 arrays containing 3 copies of 0..n-1 with no element 1 greater than its northwest or southwest neighbor modulo n and the upper left element equal to 0.
%C A266571 Column 3 of A266572.
%e A266571 Some solutions for n=4
%e A266571 ..0..2..1....0..3..1....0..2..2....0..0..3....0..2..1....0..2..3....0..2..3
%e A266571 ..3..2..2....1..3..2....2..3..0....1..0..2....0..3..1....2..0..1....3..0..0
%e A266571 ..0..3..1....0..0..1....1..1..1....1..3..2....3..2..1....2..1..3....1..1..2
%e A266571 ..0..3..1....2..3..2....3..3..0....1..3..2....3..2..0....1..0..3....2..3..1
%Y A266571 Cf. A266572.
%K A266571 nonn
%O A266571 1,3
%A A266571 _R. H. Hardin_, Jan 01 2016

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.