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.

A208037 Number of nX6 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 0 and 1 0 1 vertically.

This page as a plain text file.
%I A208037 #7 Jul 22 2025 21:07:54
%S A208037 25,625,3969,23409,137641,811801,4791721,28334329,167314225,987656329,
%T A208037 5832835129,34448473609,203428962961,1201297105369,7094141691289,
%U A208037 41893968228025,247400088307849,1460990772422281,8627719639899361
%N A208037 Number of nX6 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 0 and 1 0 1 vertically.
%C A208037 Column 6 of A208039
%H A208037 R. H. Hardin, <a href="/A208037/b208037.txt">Table of n, a(n) for n = 1..210</a>
%F A208037 Empirical: a(n) = 2*a(n-1) +10*a(n-2) +53*a(n-3) +144*a(n-4) +139*a(n-5) -542*a(n-6) -1870*a(n-7) -1005*a(n-8) +2821*a(n-9) +3667*a(n-10) -1118*a(n-11) -2098*a(n-12) +864*a(n-13) +3529*a(n-14) +6316*a(n-15) +3326*a(n-16) +1343*a(n-17) -3558*a(n-18) +1437*a(n-19) -5034*a(n-20) +2804*a(n-21) -5891*a(n-22) +3521*a(n-23) -3008*a(n-24) +3398*a(n-25) -1498*a(n-26) +1049*a(n-27) -755*a(n-28) +265*a(n-29) -192*a(n-30) +81*a(n-31) -16*a(n-32) +12*a(n-33) -5*a(n-34) +3*a(n-35) -a(n-36) for n>37
%e A208037 Some solutions for n=4
%e A208037 ..1..1..1..1..1..0....0..1..1..1..0..1....1..1..0..1..1..0....0..1..1..1..0..0
%e A208037 ..1..1..1..0..1..1....0..1..1..1..1..1....0..0..1..1..0..1....1..0..1..1..1..0
%e A208037 ..1..1..1..0..1..1....1..1..1..1..1..0....0..0..1..1..0..1....1..0..0..1..1..1
%e A208037 ..1..1..1..1..1..1....1..0..0..1..1..0....1..1..0..0..1..1....1..1..0..1..1..1
%K A208037 nonn
%O A208037 1,1
%A A208037 _R. H. Hardin_ Feb 22 2012