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.

A267626 Number of nX3 arrays containing 3 copies of 0..n-1 with every element equal to or 1 greater than any west neighbor modulo n and the upper left element equal to 0.

This page as a plain text file.
%I A267626 #4 Aug 12 2016 07:05:18
%S A267626 1,10,39,208,1576,14830,168500,2247280,34423760,596248800,11529957600,
%T A267626 246360114000
%N A267626 Number of nX3 arrays containing 3 copies of 0..n-1 with every element equal to or 1 greater than any west neighbor modulo n and the upper left element equal to 0.
%C A267626 Column 3 of A267629.
%e A267626 Some solutions for n=4
%e A267626 ..0..1..2....0..1..2....0..1..2....0..0..0....0..0..1....0..1..2....0..0..1
%e A267626 ..0..1..1....0..1..1....3..0..1....1..1..1....0..1..2....0..1..2....1..2..3
%e A267626 ..2..3..3....2..2..3....3..3..0....2..2..2....1..2..3....3..0..1....3..0..1
%e A267626 ..2..3..0....3..3..0....1..2..2....3..3..3....2..3..3....2..3..3....2..2..3
%Y A267626 Cf. A267629.
%K A267626 nonn
%O A267626 1,2
%A A267626 _R. H. Hardin_, Jan 18 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.