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.

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

This page as a plain text file.
%I A231193 #6 Jul 23 2025 06:17:28
%S A231193 67,1413,31665,704428,15698874,349736292,7791727354,173590087438,
%T A231193 3867375772894,86160416104014,1919549013278026,42765211455425302,
%U A231193 952756766481301782,21226259035646084422,472895169574435473198
%N A231193 Number of (n+1)X(2+1) 0..2 arrays with no element equal to a strict majority of its horizontal, vertical and antidiagonal neighbors, with values 0..2 introduced in row major order.
%C A231193 Column 2 of A231199
%H A231193 R. H. Hardin, <a href="/A231193/b231193.txt">Table of n, a(n) for n = 1..210</a>
%F A231193 Empirical: a(n) = 22*a(n-1) +7*a(n-2) -24*a(n-3) +218*a(n-4) -1474*a(n-5) -4420*a(n-6) +892*a(n-7) +1572*a(n-8) +5428*a(n-9) +124572*a(n-10) +179816*a(n-11) -55176*a(n-12) -492608*a(n-13) -667584*a(n-14) -56192*a(n-15) +368640*a(n-16) +246784*a(n-17) -61440*a(n-18)
%e A231193 Some solutions for n=3
%e A231193 ..0..1..2....0..1..1....0..0..1....0..1..0....0..1..2....0..0..0....0..1..1
%e A231193 ..2..1..1....1..0..2....1..2..1....0..0..1....1..0..1....1..1..1....0..0..0
%e A231193 ..0..1..2....1..1..0....0..2..2....2..2..2....2..1..1....1..0..2....1..2..2
%e A231193 ..1..0..0....0..0..2....1..0..1....0..0..0....2..0..0....2..1..0....1..0..1
%K A231193 nonn
%O A231193 1,1
%A A231193 _R. H. Hardin_, Nov 05 2013