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 A208041 #7 Jul 22 2025 21:08:16 %S A208041 13,169,741,3249,21147,137641,766115,4264225,25232235,149303961, %T A208041 862184859,4978854721,29034369719,169314967441,983440982185, %U A208041 5712171700225,33232678181985,193343435230401,1124082152541891 %N A208041 Number of 5Xn 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 0 and 1 0 1 vertically. %C A208041 Row 5 of A208039 %H A208041 R. H. Hardin, <a href="/A208041/b208041.txt">Table of n, a(n) for n = 1..210</a> %F A208041 Empirical: a(n) = 3*a(n-1) +48*a(n-3) +388*a(n-4) -347*a(n-5) -147*a(n-6) -4671*a(n-7) -37356*a(n-8) +24686*a(n-9) +85052*a(n-10) +78924*a(n-11) +938334*a(n-12) -443355*a(n-13) -1927859*a(n-14) -221948*a(n-15) -11772417*a(n-16) +3859044*a(n-17) +15010692*a(n-18) -6153277*a(n-19) +80642025*a(n-20) -29254311*a(n-21) -39833313*a(n-22) +47039901*a(n-23) -283943886*a(n-24) +157451184*a(n-25) -4805325*a(n-26) -55544475*a(n-27) +457782645*a(n-28) -300843696*a(n-29) +69603649*a(n-30) +13613667*a(n-31) -373796799*a(n-32) +264801423*a(n-33) -43749832*a(n-34) -2582299*a(n-35) +151085397*a(n-36) -110771760*a(n-37) +4192812*a(n-38) +6445120*a(n-39) -23917616*a(n-40) +17965824*a(n-41) -595008*a(n-42) -768768*a(n-43) +1379840*a(n-44) -1113088*a(n-45) +76800*a(n-46) -12288*a(n-48) +16384*a(n-49) %e A208041 Some solutions for n=4 %e A208041 ..1..0..1..1....0..0..1..1....0..1..1..1....1..1..0..0....0..0..1..1 %e A208041 ..1..0..0..1....0..0..1..1....0..0..1..1....0..0..1..1....1..0..0..1 %e A208041 ..1..1..0..0....1..1..0..1....1..0..0..1....0..0..1..1....1..1..0..0 %e A208041 ..0..1..1..0....1..1..0..0....1..1..0..1....1..1..0..1....1..1..1..0 %e A208041 ..0..1..1..1....1..1..1..0....1..1..1..1....1..1..0..0....0..0..1..1 %K A208041 nonn %O A208041 1,1 %A A208041 _R. H. Hardin_ Feb 22 2012