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.

A267749 Number of nX4 arrays of permutations of 4 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 A267749 #3 Jan 20 2016 08:22:36
%S A267749 1,35,357,2386,13451,68151,314491,1381976,5796165,23520067,92980625
%N A267749 Number of nX4 arrays of permutations of 4 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 A267749 Column 4 of A267751.
%e A267749 Some solutions for n=4
%e A267749 ..0..3..2..0....0..0..1..3....0..1..0..3....0..1..3..2....0..0..3..2
%e A267749 ..1..3..3..1....1..1..2..3....1..1..0..3....0..1..3..3....1..1..3..2
%e A267749 ..2..0..3..1....2..1..3..3....2..2..0..3....1..2..3..0....1..2..3..3
%e A267749 ..2..1..0..2....2..2..0..0....2..2..1..3....2..2..0..1....1..2..0..0
%Y A267749 Cf. A267751.
%K A267749 nonn
%O A267749 1,2
%A A267749 _R. H. Hardin_, Jan 20 2016