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.

A231268 Number of (6+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 A231268 #6 Jul 23 2025 06:21:49
%S A231268 1366,20911,289230,4670875,77333664,1350570015,23652344858,
%T A231268 421109550715,7513589661255,134646767819908,2415227031044881,
%U A231268 43379008701842234,779417439093210714,14009470607780211440,251841034462913263365
%N A231268 Number of (6+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 A231268 Row 6 of A231263
%H A231268 R. H. Hardin, <a href="/A231268/b231268.txt">Table of n, a(n) for n = 1..71</a>
%e A231268 Some solutions for n=3
%e A231268 ..0..0..0..0....0..0..0..0....0..0..0..0....0..0..0..0....0..0..0..0
%e A231268 ..1..1..0..1....1..1..0..0....0..1..1..2....0..0..1..1....0..0..1..1
%e A231268 ..1..0..1..1....1..0..0..1....1..1..2..2....1..1..0..0....1..1..0..0
%e A231268 ..0..0..0..0....1..1..1..1....1..1..1..1....1..0..0..0....0..0..0..2
%e A231268 ..0..2..2..0....1..0..0..0....1..2..2..2....0..0..1..1....0..0..2..2
%e A231268 ..2..2..0..1....0..1..1..2....2..2..2..1....0..1..1..1....2..2..2..2
%e A231268 ..0..0..1..1....1..1..2..2....1..1..1..1....2..2..2..2....0..0..0..0
%K A231268 nonn
%O A231268 1,1
%A A231268 _R. H. Hardin_, Nov 06 2013