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 A207490 #7 Jul 22 2025 20:29:47 %S A207490 14,196,408,1459,4041,8808,21991,48044,105558,230156,490287,1049299, %T A207490 2221620,4710903,9955616,21033770,44465838,93802765,198306079, %U A207490 418690364,884240221,1869141068,3946519000,8342005680,17626630049,37237956591 %N A207490 Number of 5Xn 0..1 arrays avoiding 0 0 0 and 0 1 1 horizontally and 0 1 1 and 1 1 0 vertically. %C A207490 Row 5 of A207488 %H A207490 R. H. Hardin, <a href="/A207490/b207490.txt">Table of n, a(n) for n = 1..210</a> %F A207490 Empirical: a(n) = a(n-1) +5*a(n-2) +9*a(n-3) -24*a(n-4) -39*a(n-5) -30*a(n-6) +138*a(n-7) +174*a(n-8) +93*a(n-9) -491*a(n-10) -626*a(n-11) -220*a(n-12) +1436*a(n-13) +1645*a(n-14) +53*a(n-15) -3311*a(n-16) -2794*a(n-17) +1013*a(n-18) +5466*a(n-19) +3055*a(n-20) -2604*a(n-21) -6394*a(n-22) -2236*a(n-23) +3343*a(n-24) +5400*a(n-25) +1218*a(n-26) -2618*a(n-27) -3363*a(n-28) -623*a(n-29) +1314*a(n-30) +1559*a(n-31) +321*a(n-32) -425*a(n-33) -525*a(n-34) -124*a(n-35) +88*a(n-36) +119*a(n-37) +26*a(n-38) -12*a(n-39) -16*a(n-40) -2*a(n-41) +a(n-42) +a(n-43) %e A207490 Some solutions for n=4 %e A207490 ..0..1..0..0....0..1..0..1....1..1..0..1....1..0..0..1....0..1..0..1 %e A207490 ..0..0..1..0....1..0..1..0....0..1..0..1....1..1..1..0....0..0..1..0 %e A207490 ..0..1..0..1....0..1..0..0....1..1..0..1....1..0..0..1....1..0..0..1 %e A207490 ..0..0..1..0....0..0..1..0....0..1..0..1....1..0..1..0....0..1..0..0 %e A207490 ..1..1..0..1....0..1..0..0....1..1..0..1....1..0..0..1....1..0..0..1 %K A207490 nonn %O A207490 1,1 %A A207490 _R. H. Hardin_ Feb 18 2012