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.

A267628 Number of nX5 arrays of permutations of 5 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 A267628 #3 Jan 18 2016 15:13:01
%S A267628 1,126,1802,32208,679735,19027506,651123366,25708254936
%N A267628 Number of nX5 arrays of permutations of 5 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 A267628 Column 5 of A267629.
%e A267628 Some solutions for n=4
%e A267628 ..0..0..1..1..2....0..1..1..2..3....0..0..1..1..2....0..1..2..3..0
%e A267628 ..1..2..3..3..3....1..1..2..3..3....0..0..1..2..3....1..2..3..3..0
%e A267628 ..2..2..3..0..0....3..3..0..0..0....1..2..2..3..3....1..1..2..2..3
%e A267628 ..1..1..2..3..0....0..1..2..2..2....1..2..3..3..0....3..0..0..1..2
%Y A267628 Cf. A267629.
%K A267628 nonn
%O A267628 1,2
%A A267628 _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.