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.

A267279 Number of (n+1)Xn arrays containing n copies of 0..n+1-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 A267279 #5 Aug 12 2016 06:54:00
%S A267279 1,5,24,293,6240,315356,33284502
%N A267279 Number of (n+1)Xn arrays containing n copies of 0..n+1-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 A267279 Subdiagonal 1 of A267278.
%e A267279 Some solutions for n=4
%e A267279 ..0..2..1..4....0..3..1..4....0..4..2..1....0..3..1..0....0..3..1..0
%e A267279 ..2..0..3..1....2..0..3..1....3..1..0..3....3..1..4..2....3..1..4..2
%e A267279 ..4..2..0..3....4..2..0..3....1..4..2..1....1..4..2..4....0..3..2..4
%e A267279 ..1..4..3..1....1..4..2..1....4..2..0..3....3..1..4..2....3..1..4..2
%e A267279 ..3..2..0..4....4..2..0..3....2..4..3..0....0..3..2..0....1..4..2..0
%Y A267279 Cf. A267278.
%K A267279 nonn
%O A267279 1,2
%A A267279 _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.