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.

A267624 Number of n X n arrays containing n copies of 0..n-1 with every element equal to or 1 greater than any west neighbor modulo n and the upper left element equal to 0.

This page as a plain text file.
%I A267624 #8 Apr 14 2020 21:34:51
%S A267624 1,3,39,2386,679735,873319806,4934982616333
%N A267624 Number of n X n arrays containing n copies of 0..n-1 with every element equal to or 1 greater than any west neighbor modulo n and the upper left element equal to 0.
%C A267624 Diagonal of A267629.
%e A267624 Some solutions for n=4
%e A267624 ..0..0..1..1....0..0..1..2....0..0..1..2....0..0..1..2....0..0..0..1
%e A267624 ..1..2..3..0....0..0..1..1....1..2..2..3....3..3..0..1....2..2..3..3
%e A267624 ..3..0..1..2....1..2..3..3....3..3..0..1....1..2..2..3....1..1..2..3
%e A267624 ..2..2..3..3....2..2..3..3....0..1..2..3....1..2..3..0....2..3..0..1
%Y A267624 Cf. A267629.
%K A267624 nonn
%O A267624 1,2
%A A267624 _R. H. Hardin_, Jan 18 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.