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.

A232282 Number of 2 X n 0..2 arrays with no element less than a strict majority of its horizontal, diagonal and antidiagonal neighbors.

This page as a plain text file.
%I A232282 #6 Apr 21 2024 22:45:26
%S A232282 9,35,199,1066,6019,32301,174400,944500,5142177,27937799,151639871,
%T A232282 822991186,4468833656,24267873410,131775553922,715505284261,
%U A232282 3885076657421,21095823631806,114549994256771,622001619001412
%N A232282 Number of 2 X n 0..2 arrays with no element less than a strict majority of its horizontal, diagonal and antidiagonal neighbors.
%C A232282 Row 2 of A232281.
%H A232282 R. H. Hardin, <a href="/A232282/b232282.txt">Table of n, a(n) for n = 1..210</a>
%F A232282 Empirical: a(n) = 9*a(n-1) -23*a(n-2) +20*a(n-3) +81*a(n-4) -511*a(n-5) +294*a(n-6) +150*a(n-7) -168*a(n-8) +1692*a(n-9) +432*a(n-10).
%e A232282 Some solutions for n=7
%e A232282 ..0..2..2..2..0..0..0....0..2..1..1..0..2..0....0..0..0..2..0..0..0
%e A232282 ..2..0..0..0..1..0..2....2..0..0..0..2..0..2....0..2..1..0..1..2..2
%Y A232282 Cf. A232281.
%K A232282 nonn
%O A232282 1,1
%A A232282 _R. H. Hardin_, Nov 22 2013