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.

A267021 Number of nX(n+1) arrays of permutations of n+1 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 A267021 #3 Jan 09 2016 09:03:52
%S A267021 1,10,59,759,18157,912057,100710495
%N A267021 Number of nX(n+1) arrays of permutations of n+1 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 A267021 Superdiagonal 1 of A267019.
%e A267021 Some solutions for n=4
%e A267021 ..0..1..3..1..0....0..1..3..1..3....0..2..1..3..0....0..2..0..2..0
%e A267021 ..2..0..2..0..2....2..0..1..3..1....3..1..3..1..3....2..0..3..1..2
%e A267021 ..1..3..1..3..1....0..2..0..2..3....2..3..2..0..1....1..3..1..3..1
%e A267021 ..3..2..3..2..0....2..1..2..0..3....0..2..0..2..1....3..2..0..1..3
%Y A267021 Cf. A267019.
%K A267021 nonn
%O A267021 1,2
%A A267021 _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.