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.

A267750 Number of nX5 arrays of permutations of 5 copies of 0..n-1 with every element equal to or 1 greater than any north neighbor modulo n and the upper left element equal to 0.

This page as a plain text file.
%I A267750 #3 Jan 20 2016 08:23:00
%S A267750 1,126,3471,54956,679735,7280046,69784981,619463736
%N A267750 Number of nX5 arrays of permutations of 5 copies of 0..n-1 with every element equal to or 1 greater than any north neighbor modulo n and the upper left element equal to 0.
%C A267750 Column 5 of A267751.
%e A267750 Some solutions for n=4
%e A267750 ..0..1..0..3..3....0..3..1..2..0....0..1..1..3..2....0..0..2..1..0
%e A267750 ..0..2..1..3..3....1..0..2..2..1....0..1..2..3..2....1..1..2..2..0
%e A267750 ..1..2..2..3..0....2..0..2..3..1....1..2..3..0..3....2..1..3..3..0
%e A267750 ..1..2..2..0..1....3..0..3..3..1....1..2..0..0..3....3..2..3..3..1
%Y A267750 Cf. A267751.
%K A267750 nonn
%O A267750 1,2
%A A267750 _R. H. Hardin_, Jan 20 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.