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.

A232050 Number of 4Xn 0..1 arrays with no element less than a strict majority of its horizontal and antidiagonal neighbors.

This page as a plain text file.
%I A232050 #6 Jul 23 2025 06:50:26
%S A232050 16,65,446,3082,22063,153562,1060850,7322233,50611921,350063149,
%T A232050 2421230532,16745004894,115803439202,800864168388,5538580113288,
%U A232050 38303510063492,264897950563469,1831970665295301,12669468933770841
%N A232050 Number of 4Xn 0..1 arrays with no element less than a strict majority of its horizontal and antidiagonal neighbors.
%C A232050 Row 4 of A232047
%H A232050 R. H. Hardin, <a href="/A232050/b232050.txt">Table of n, a(n) for n = 1..210</a>
%F A232050 Empirical: a(n) = 16*a(n-1) -115*a(n-2) +565*a(n-3) -2034*a(n-4) +5817*a(n-5) -13565*a(n-6) +26712*a(n-7) -45206*a(n-8) +66931*a(n-9) -89161*a(n-10) +109246*a(n-11) -128417*a(n-12) +138117*a(n-13) -133354*a(n-14) +106727*a(n-15) -71595*a(n-16) +45288*a(n-17) -14520*a(n-18) -13147*a(n-19) +45149*a(n-20) -49440*a(n-21) +35999*a(n-22) -13855*a(n-23) +8496*a(n-24) +5713*a(n-25) +1489*a(n-26) -5200*a(n-27) -450*a(n-28) +1011*a(n-29) +205*a(n-30) -126*a(n-31) -24*a(n-32) +9*a(n-33) for n>36
%e A232050 Some solutions for n=5
%e A232050 ..0..0..0..0..1....1..1..1..1..1....0..0..1..0..0....0..0..0..0..0
%e A232050 ..0..1..0..0..0....0..0..0..0..0....0..0..0..0..0....1..0..1..1..1
%e A232050 ..1..0..0..0..1....1..1..1..0..0....0..1..0..1..0....0..1..0..0..0
%e A232050 ..0..0..0..1..1....0..0..0..0..1....0..0..0..0..1....1..0..0..0..0
%K A232050 nonn
%O A232050 1,1
%A A232050 _R. H. Hardin_, Nov 17 2013