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 A206933 #7 Jul 22 2025 19:48:48 %S A206933 24,576,6139,55088,418876,2967939,20054092,132811808,872534329, %T A206933 5738891880,37936245944,252477346073,1691541385664,11399493261624, %U A206933 77185331515715,524508182445648,3573732263034644,24395832049714499 %N A206933 Number of nX5 0..1 arrays avoiding 0 0 0 horizontally and 0 1 1 vertically. %C A206933 Column 5 of A206936 %H A206933 R. H. Hardin, <a href="/A206933/b206933.txt">Table of n, a(n) for n = 1..210</a> %F A206933 Empirical: a(n) = 16*a(n-1) -51*a(n-2) -382*a(n-3) +2316*a(n-4) +2418*a(n-5) -33825*a(n-6) +7564*a(n-7) +259597*a(n-8) -162444*a(n-9) -1219656*a(n-10) +831300*a(n-11) +3729358*a(n-12) -2081904*a(n-13) -7504662*a(n-14) +2731608*a(n-15) +9782192*a(n-16) -1707672*a(n-17) -8064954*a(n-18) +220920*a(n-19) +4121746*a(n-20) +285804*a(n-21) -1292280*a(n-22) -158436*a(n-23) +246867*a(n-24) +34784*a(n-25) -28503*a(n-26) -3770*a(n-27) +1924*a(n-28) +198*a(n-29) -69*a(n-30) -4*a(n-31) +a(n-32) %e A206933 Some solutions for n=4 %e A206933 ..0..1..0..0..1....0..1..1..1..0....1..1..1..1..0....1..1..1..0..0 %e A206933 ..0..1..0..0..1....1..1..1..0..0....1..1..1..1..1....0..1..1..1..1 %e A206933 ..1..0..0..1..1....0..1..0..1..1....1..1..1..1..0....0..1..1..0..0 %e A206933 ..0..0..1..0..0....0..0..1..0..0....1..1..1..1..1....1..0..1..1..1 %K A206933 nonn %O A206933 1,1 %A A206933 _R. H. Hardin_ Feb 13 2012