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.

A231389 Number of (n+1)X(n+1) 0..2 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with values 0..2 introduced in row major order.

This page as a plain text file.
%I A231389 #6 Jul 23 2025 06:27:06
%S A231389 3,8,100,1096,41237,3002376,374180527,105642740621
%N A231389 Number of (n+1)X(n+1) 0..2 arrays with no element unequal to a strict majority of its horizontal, diagonal and antidiagonal neighbors, with values 0..2 introduced in row major order.
%C A231389 Diagonal of A231396
%e A231389 Some solutions for n=5
%e A231389 ..0..0..0..1..0..0....0..0..0..1..1..1....0..0..1..1..1..0....0..0..0..0..0..0
%e A231389 ..0..0..1..0..1..0....0..0..0..1..1..1....0..1..1..1..0..0....1..1..0..0..2..2
%e A231389 ..1..1..0..1..0..1....0..0..1..0..0..0....0..0..1..1..0..0....1..1..1..2..2..2
%e A231389 ..1..1..1..0..1..1....1..1..1..1..0..0....0..0..1..1..1..0....2..2..2..1..1..1
%e A231389 ..1..1..0..0..1..1....1..1..1..1..0..0....0..0..1..1..0..0....2..2..2..2..1..1
%e A231389 ..1..1..0..0..0..1....1..1..1..0..0..0....0..0..1..1..0..0....2..2..2..2..2..2
%K A231389 nonn
%O A231389 1,1
%A A231389 _R. H. Hardin_, Nov 08 2013