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.

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

This page as a plain text file.
%I A267280 #3 Jan 12 2016 16:01:21
%S A267280 1,10,109,1138,18276,663855,55479601,12194740046
%N A267280 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 southwest or northwest neighbors modulo n and the upper left element equal to 0.
%C A267280 Superdiagonal 1 of A267278.
%e A267280 Some solutions for n=4
%e A267280 ..0..3..2..1..0....0..2..1..3..2....0..3..2..0..0....0..3..2..1..3
%e A267280 ..2..1..0..3..1....2..1..3..1..0....2..1..0..3..1....3..1..0..2..1
%e A267280 ..1..3..2..0..0....0..3..1..3..2....1..3..2..1..3....0..3..1..1..3
%e A267280 ..2..2..3..3..1....2..0..3..1..0....2..2..0..3..1....2..0..0..2..2
%Y A267280 Cf. A267278.
%K A267280 nonn
%O A267280 1,2
%A A267280 _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.