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 A208166 #7 Jul 22 2025 21:13:02 %S A208166 14,196,882,3893,14446,55576,222487,873641,3397748,13352522,52449423, %T A208166 205347969,804974692,3157691203,12378682019,48526203780,190271720018, %U A208166 746002420845,2924723857799,11466940285385,44958442042385 %N A208166 Number of 5Xn 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 0 1 0 vertically. %C A208166 Row 5 of A208164 %H A208166 R. H. Hardin, <a href="/A208166/b208166.txt">Table of n, a(n) for n = 1..210</a> %F A208166 Empirical: a(n) = 35*a(n-3) +75*a(n-4) +153*a(n-5) -12*a(n-6) -491*a(n-7) -1291*a(n-8) -1213*a(n-9) +982*a(n-10) +5255*a(n-11) +6710*a(n-12) +298*a(n-13) -13367*a(n-14) -19234*a(n-15) -4320*a(n-16) +24239*a(n-17) +34110*a(n-18) +7289*a(n-19) -33569*a(n-20) -38074*a(n-21) -1658*a(n-22) +31010*a(n-23) +23461*a(n-24) -3165*a(n-25) -16769*a(n-26) -8111*a(n-27) +2648*a(n-28) +5511*a(n-29) +1251*a(n-30) -962*a(n-31) -1204*a(n-32) +101*a(n-33) +205*a(n-34) +215*a(n-35) -55*a(n-36) -26*a(n-37) -26*a(n-38) for n>40 %e A208166 Some solutions for n=4 %e A208166 ..0..0..1..1....0..0..1..0....1..0..0..1....0..1..1..0....1..1..0..0 %e A208166 ..1..0..0..1....1..1..0..0....1..0..0..1....0..0..1..0....1..0..0..1 %e A208166 ..1..0..0..1....1..1..1..0....1..0..0..1....0..0..1..0....1..0..0..1 %e A208166 ..1..0..0..1....1..1..1..0....1..0..0..1....0..0..1..0....1..0..0..1 %e A208166 ..1..0..0..1....1..1..1..0....1..0..0..1....0..0..1..0....1..0..0..1 %K A208166 nonn %O A208166 1,1 %A A208166 _R. H. Hardin_ Feb 24 2012