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.

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

This page as a plain text file.
%I A266453 #4 Aug 12 2016 07:05:17
%S A266453 1,0,39,6152,2079765,1362641028,1511484069811,2623713101882928,
%T A266453 6717410044413848265
%N A266453 Number of nX3 arrays containing 3 copies of 0..n-1 with no element 1 greater than its north neighbor modulo n and the upper left element equal to 0.
%C A266453 Column 3 of A266455.
%e A266453 Some solutions for n=4
%e A266453 ..0..1..1....0..3..1....0..1..3....0..1..2....0..3..2....0..3..2....0..3..1
%e A266453 ..3..3..0....2..1..1....3..0..1....2..0..2....2..3..2....2..1..1....3..2..0
%e A266453 ..3..2..0....0..3..3....3..2..0....1..0..1....1..1..0....1..0..3....3..1..0
%e A266453 ..1..2..2....0..2..2....1..2..2....3..3..3....1..0..3....3..0..2....2..1..2
%Y A266453 Cf. A266455.
%K A266453 nonn
%O A266453 1,3
%A A266453 _R. H. Hardin_, Dec 29 2015

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

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