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.

A266454 Number of nX4 arrays of permutations of 4 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 A266454 #3 Dec 29 2015 13:26:12
%S A266454 1,3,357,442285,1548940233,12959331192279,218375094825289861
%N A266454 Number of nX4 arrays of permutations of 4 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 A266454 Column 4 of A266455.
%e A266454 Some solutions for n=3
%e A266454 ..0..0..2..1....0..1..0..1....0..2..1..1....0..1..0..2....0..1..2..2
%e A266454 ..2..2..1..1....2..0..2..1....2..2..1..0....2..1..0..1....0..1..1..2
%e A266454 ..2..1..0..0....1..2..2..0....1..2..0..0....2..1..2..0....0..0..1..2
%Y A266454 Cf. A266455.
%K A266454 nonn
%O A266454 1,2
%A A266454 _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.