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.

A267281 Number of nX(n+2) arrays of permutations of n+2 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 A267281 #3 Jan 12 2016 16:02:00
%S A267281 1,35,574,12214,330969,12954512,912215513
%N A267281 Number of nX(n+2) arrays of permutations of n+2 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 A267281 Superdiagonal 2 of A267278.
%e A267281 Some solutions for n=4
%e A267281 ..0..0..0..1..1..2....0..2..1..0..3..1....0..0..2..2..3..3....0..3..2..1..3..2
%e A267281 ..3..0..1..1..2..2....1..1..3..2..0..3....3..1..1..2..2..3....3..1..0..2..1..3
%e A267281 ..3..0..0..2..2..3....0..2..2..3..2..0....0..0..1..1..3..2....1..3..2..0..3..1
%e A267281 ..3..3..1..1..3..2....1..1..3..2..0..3....0..0..1..2..1..3....2..1..0..2..0..0
%Y A267281 Cf. A267278.
%K A267281 nonn
%O A267281 1,2
%A A267281 _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.