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.

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

This page as a plain text file.
%I A231267 #6 Jul 23 2025 06:21:42
%S A231267 342,3381,29366,302121,3130708,34170727,373664749,4147016414,
%T A231267 46117392977,515063996641,5757867388323,64448318261860,
%U A231267 721609183551621,8082185902161731,90528853400096455,1014081345152953804
%N A231267 Number of (5+1)X(n+1) 0..2 arrays with no element unequal to a strict majority of its horizontal and antidiagonal neighbors, with values 0..2 introduced in row major order.
%C A231267 Row 5 of A231263
%H A231267 R. H. Hardin, <a href="/A231267/b231267.txt">Table of n, a(n) for n = 1..210</a>
%e A231267 Some solutions for n=3
%e A231267 ..0..0..0..1....0..0..0..0....0..0..1..1....0..0..0..0....0..0..0..0
%e A231267 ..0..0..1..0....0..0..0..1....0..1..1..1....0..0..0..1....1..1..2..2
%e A231267 ..0..1..0..0....0..0..1..2....2..2..1..1....0..1..1..1....1..2..2..0
%e A231267 ..1..1..2..2....1..1..2..2....2..1..1..1....1..1..0..0....0..0..0..1
%e A231267 ..1..2..2..0....2..2..2..2....1..0..0..0....0..0..0..1....1..1..1..2
%e A231267 ..0..0..0..0....0..0..0..0....0..0..0..0....0..0..1..1....1..1..2..2
%K A231267 nonn
%O A231267 1,1
%A A231267 _R. H. Hardin_, Nov 06 2013