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.

A267282 Number of nX(n+3) arrays of permutations of n+3 copies of 0..n-1 with every element equal to or 1 greater than any southwest or northwest neighbors modulo n and the upper left element equal to 0.

This page as a plain text file.
%I A267282 #3 Jan 12 2016 16:02:42
%S A267282 1,126,2840,104742,5977624,466131976
%N A267282 Number of nX(n+3) arrays of permutations of n+3 copies of 0..n-1 with every element equal to or 1 greater than any southwest or northwest neighbors modulo n and the upper left element equal to 0.
%C A267282 Superdiagonal 3 of A267278.
%e A267282 Some solutions for n=4
%e A267282 ..0..0..1..1..2..2..3....0..1..0..2..1..3..3....0..1..2..2..2..3..0
%e A267282 ..3..0..0..1..1..3..3....0..0..2..1..2..2..0....0..1..1..2..3..3..0
%e A267282 ..0..3..1..0..2..2..3....3..1..0..2..2..3..3....0..1..1..2..3..3..0
%e A267282 ..2..1..0..2..1..3..2....1..3..1..1..2..3..0....1..1..2..2..3..3..0
%Y A267282 Cf. A267278.
%K A267282 nonn
%O A267282 1,2
%A A267282 _R. H. Hardin_, Jan 12 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.