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.

A232132 Number of (n+1)X(3+1) 0..2 arrays with no element equal 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 A232132 #6 Jul 23 2025 06:53:45
%S A232132 200,10956,602468,33162868,1825568436,100495188564,5532131001812,
%T A232132 304536704087316,16764354299718484,922856165828434964,
%U A232132 50802046269213120468,2796587378080211658132,153948542186521174138196
%N A232132 Number of (n+1)X(3+1) 0..2 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors, with values 0..2 introduced in row major order.
%C A232132 Column 3 of A232137
%H A232132 R. H. Hardin, <a href="/A232132/b232132.txt">Table of n, a(n) for n = 1..210</a>
%F A232132 Empirical: a(n) = 65*a(n-1) -588*a(n-2) +2304*a(n-3) -5156*a(n-4) +7136*a(n-5) -5632*a(n-6) +2048*a(n-7) -256*a(n-8)
%e A232132 Some solutions for n=2
%e A232132 ..0..1..1..2....0..1..2..2....0..1..2..2....0..1..1..2....0..1..0..2
%e A232132 ..0..0..1..1....0..0..0..1....2..1..1..0....2..0..1..2....0..2..2..1
%e A232132 ..1..2..2..0....2..0..2..0....0..1..2..1....1..0..0..2....0..1..2..0
%K A232132 nonn
%O A232132 1,1
%A A232132 _R. H. Hardin_, Nov 19 2013