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.

A231259 Number of (n+1)X(4+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 A231259 #6 Jul 23 2025 06:20:55
%S A231259 7,83,1253,19503,302121,4670875,72212345,1116538567,17264116873,
%T A231259 266940042371,4127456101305,63819175744751,986779131942921,
%U A231259 15257688013347083,235916058283574201,3647760162012484183
%N A231259 Number of (n+1)X(4+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 A231259 Column 4 of A231263
%H A231259 R. H. Hardin, <a href="/A231259/b231259.txt">Table of n, a(n) for n = 1..210</a>
%F A231259 Empirical: a(n) = 31*a(n-1) -364*a(n-2) +2570*a(n-3) -12609*a(n-4) +44731*a(n-5) -117554*a(n-6) +227260*a(n-7) -319008*a(n-8) +314816*a(n-9) -208992*a(n-10) +83456*a(n-11) -14336*a(n-12)
%e A231259 Some solutions for n=3
%e A231259 ..0..0..0..1..1....0..0..0..0..0....0..0..1..1..1....0..0..1..1..1
%e A231259 ..0..0..1..2..2....0..0..0..1..1....0..1..0..0..0....0..1..0..0..2
%e A231259 ..1..1..2..1..1....1..1..1..2..2....1..0..2..2..2....1..0..0..2..0
%e A231259 ..2..2..1..1..1....2..2..2..2..2....0..2..2..2..2....2..2..2..0..0
%K A231259 nonn
%O A231259 1,1
%A A231259 _R. H. Hardin_, Nov 06 2013