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.

A267018 Number of n X n arrays containing n 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 A267018 #10 Apr 14 2020 21:33:39
%S A267018 1,3,15,137,2063,69265,4893787,787556232
%N A267018 Number of n X n arrays containing n 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 A267018 Diagonal of A267019.
%e A267018 Some solutions for n=4
%e A267018 ..0..3..1..3....0..1..3..2....0..2..0..1....0..3..1..2....0..2..0..3
%e A267018 ..3..1..0..2....1..0..2..3....2..0..2..1....3..1..3..1....2..1..3..1
%e A267018 ..2..0..2..0....1..2..0..3....0..3..1..3....2..0..1..3....1..3..1..0
%e A267018 ..1..3..1..2....2..1..3..0....3..1..3..2....0..2..0..2....3..2..0..2
%Y A267018 Cf. A267020.
%K A267018 nonn
%O A267018 1,2
%A A267018 _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.