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.

A267022 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 northeast or northwest neighbors modulo n and the upper left element equal to 0.

This page as a plain text file.
%I A267022 #3 Jan 09 2016 09:04:19
%S A267022 1,35,257,4835,172169,13122646,2166450939
%N A267022 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 northeast or northwest neighbors modulo n and the upper left element equal to 0.
%C A267022 Superdiagonal 2 of A267019.
%e A267022 Some solutions for n=4
%e A267022 ..0..2..3..2..0..1....0..3..0..2..1..2....0..2..1..2..0..2....0..1..3..1..3..2
%e A267022 ..2..0..3..0..2..1....3..0..3..1..3..2....3..1..3..1..3..1....2..0..2..0..2..0
%e A267022 ..0..3..1..3..1..2....1..3..1..0..2..0....1..3..1..0..2..3....0..2..1..3..0..2
%e A267022 ..0..1..3..2..3..1....3..1..0..2..1..2....0..2..0..2..0..3....3..1..3..1..3..1
%Y A267022 Cf. A267019.
%K A267022 nonn
%O A267022 1,2
%A A267022 _R. H. Hardin_, Jan 09 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.