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 A261377 #4 Aug 17 2015 08:30:55 %S A261377 154,266,869,2282,5633,14312,39494,99168,261501,666722,1785513, %T A261377 4510376,12029879,30520850,81445076,206279050,550615794,1395355514, %U A261377 3723483907,9434612056,25180483084,63803504988,170274449783,431455039974 %N A261377 Number of (n+2)X(5+2) 0..1 arrays with each 3X3 subblock having clockwise perimeter pattern 00001011 00010101 or 01010101. %C A261377 Column 5 of A261380. %H A261377 R. H. Hardin, <a href="/A261377/b261377.txt">Table of n, a(n) for n = 1..210</a> %F A261377 Empirical: a(n) = 31*a(n-4) +97*a(n-6) +39*a(n-8) -144*a(n-10) -29*a(n-12) +189*a(n-14) -125*a(n-16) -14*a(n-18) +40*a(n-20) -13*a(n-22) -a(n-24) +a(n-26) for n>29 %e A261377 Some solutions for n=4 %e A261377 ..1..0..1..0..1..0..0....0..0..0..1..0..1..0....1..0..1..0..1..0..1 %e A261377 ..0..1..0..0..0..1..0....1..0..1..0..1..0..1....0..1..0..1..0..1..0 %e A261377 ..1..0..1..0..1..0..1....0..1..0..1..0..0..0....1..0..1..0..1..0..1 %e A261377 ..0..1..0..1..0..1..0....0..0..1..0..1..0..1....0..1..0..0..0..1..0 %e A261377 ..0..0..1..0..1..0..0....0..1..0..1..0..1..0....1..0..1..0..1..0..0 %e A261377 ..0..1..0..0..0..1..0....1..0..1..0..1..0..1....0..1..0..1..0..1..0 %Y A261377 Cf. A261380. %K A261377 nonn %O A261377 1,1 %A A261377 _R. H. Hardin_, Aug 17 2015