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 A208498 #7 Jul 22 2025 21:23:50 %S A208498 16,256,324,828,1794,4104,9912,21976,52560,121264,279930,662256, %T A208498 1518514,3571988,8299060,19262480,45164520,104532130,244409310, %U A208498 568980936,1322673264,3089796934,7178968320,16741713920,38997040062,90747250860 %N A208498 Number of nX5 0..1 arrays avoiding 0 0 0 and 0 0 1 horizontally and 0 1 0 and 1 1 1 vertically. %C A208498 Column 5 of A208501 %H A208498 R. H. Hardin, <a href="/A208498/b208498.txt">Table of n, a(n) for n = 1..210</a> %F A208498 Empirical: a(n) = a(n-2) +16*a(n-3) +2*a(n-4) +2*a(n-5) -107*a(n-6) +10*a(n-7) -75*a(n-8) +416*a(n-9) -102*a(n-10) +335*a(n-11) -965*a(n-12) +313*a(n-13) -613*a(n-14) +1499*a(n-15) -398*a(n-16) +552*a(n-17) -1629*a(n-18) +183*a(n-19) -217*a(n-20) +1234*a(n-21) +93*a(n-22) -46*a(n-23) -623*a(n-24) -161*a(n-25) +86*a(n-26) +235*a(n-27) +71*a(n-28) -35*a(n-29) -72*a(n-30) -8*a(n-31) +6*a(n-32) +13*a(n-33) -a(n-34) -a(n-36) for n>38 %e A208498 Some solutions for n=4 %e A208498 ..1..0..1..1..0....1..0..1..0..0....0..1..1..1..1....1..1..1..0..1 %e A208498 ..0..1..0..1..0....0..1..1..0..1....0..1..0..1..1....0..1..0..1..0 %e A208498 ..0..1..1..0..0....0..1..0..1..1....1..0..1..0..0....1..0..1..1..0 %e A208498 ..1..0..1..1..0....1..0..1..1..0....1..0..1..0..1....1..0..1..0..0 %K A208498 nonn %O A208498 1,1 %A A208498 _R. H. Hardin_ Feb 27 2012