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 A188853 #7 Jul 22 2025 11:25:31 %S A188853 12,144,958,5711,33037,185351,1020454,5541360,29819624,159467459, %T A188853 849225129,4509414280,23898381925,126482308739,668788464753, %U A188853 3534016278284,18666169109994,98561504556257,520314362243096 %N A188853 Number of 4Xn binary arrays without the pattern 0 0 1 vertically, antidiagonally or horizontally. %C A188853 Row 4 of A188851 %H A188853 R. H. Hardin, <a href="/A188853/b188853.txt">Table of n, a(n) for n = 1..200</a> %F A188853 Empirical: a(n) = 8*a(n-1) +15*a(n-2) -217*a(n-3) -65*a(n-4) +2637*a(n-5) +75*a(n-6) -18789*a(n-7) -1526*a(n-8) +86316*a(n-9) +19704*a(n-10) -266659*a(n-11) -102052*a(n-12) +565680*a(n-13) +288503*a(n-14) -834249*a(n-15) -499808*a(n-16) +863607*a(n-17) +561084*a(n-18) -631388*a(n-19) -421898*a(n-20) +323752*a(n-21) +217120*a(n-22) -111753*a(n-23) -77769*a(n-24) +22421*a(n-25) +19774*a(n-26) -747*a(n-27) -3667*a(n-28) -883*a(n-29) +501*a(n-30) +234*a(n-31) -46*a(n-32) -25*a(n-33) +2*a(n-34) +a(n-35) for n>38 %e A188853 Some solutions for 4X3 %e A188853 ..1..1..1....0..1..0....1..1..0....1..1..1....0..0..0....1..1..0....1..0..0 %e A188853 ..1..0..0....1..1..0....1..0..1....1..1..0....1..1..0....1..1..0....0..1..1 %e A188853 ..1..1..1....1..1..0....0..1..1....0..1..1....1..1..0....0..1..0....1..0..1 %e A188853 ..1..0..1....1..1..0....1..1..1....1..0..1....0..0..0....1..0..0....0..0..0 %K A188853 nonn %O A188853 1,1 %A A188853 _R. H. Hardin_ Apr 12 2011