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.
%I A207888 #7 Jul 22 2025 20:56:17 %S A207888 22,484,942,4881,14225,33631,138552,452415,1213630,4316538,14467167, %T A207888 42033425,139413515,465091766,1417537231,4568534780,15054960868, %U A207888 47122875377,150415872153,490190933287,1555376086444,4955936438589 %N A207888 Number of 6Xn 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 1 1 and 1 1 0 vertically. %C A207888 Row 6 of A207885 %H A207888 R. H. Hardin, <a href="/A207888/b207888.txt">Table of n, a(n) for n = 1..210</a> %F A207888 Empirical: a(n) = a(n-1) +a(n-2) +36*a(n-3) -14*a(n-4) -26*a(n-5) -435*a(n-6) +97*a(n-7) +135*a(n-8) +2888*a(n-9) -540*a(n-10) +131*a(n-11) -12541*a(n-12) +2158*a(n-13) -4031*a(n-14) +39053*a(n-15) -5366*a(n-16) +19889*a(n-17) -90907*a(n-18) +7414*a(n-19) -56374*a(n-20) +161200*a(n-21) -3221*a(n-22) +107356*a(n-23) -221425*a(n-24) -6646*a(n-25) -144964*a(n-26) +240706*a(n-27) +12411*a(n-28) +142562*a(n-29) -211220*a(n-30) -7937*a(n-31) -102645*a(n-32) +150000*a(n-33) -664*a(n-34) +52557*a(n-35) -84163*a(n-36) +4604*a(n-37) -17655*a(n-38) +35671*a(n-39) -3158*a(n-40) +3161*a(n-41) -10877*a(n-42) +982*a(n-43) +14*a(n-44) +2284*a(n-45) -119*a(n-46) -134*a(n-47) -306*a(n-48) -a(n-49) +19*a(n-50) +19*a(n-51) for n>53 %e A207888 Some solutions for n=4 %e A207888 ..0..0..1..0....1..1..0..0....1..1..1..1....0..1..0..0....0..1..1..0 %e A207888 ..1..1..0..0....1..1..0..0....0..1..1..1....1..0..0..1....1..0..0..1 %e A207888 ..0..0..1..0....1..1..1..1....0..1..1..1....0..1..0..0....0..1..1..0 %e A207888 ..1..0..0..1....1..1..0..0....0..1..1..1....1..0..0..1....1..0..0..1 %e A207888 ..0..1..0..0....1..1..1..0....0..1..1..1....0..1..0..0....0..1..0..0 %e A207888 ..0..0..1..0....1..1..0..0....1..1..1..1....0..0..1..0....1..0..0..1 %K A207888 nonn %O A207888 1,1 %A A207888 _R. H. Hardin_ Feb 21 2012