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 A251265 #6 Jun 02 2025 10:19:51 %S A251265 247,1775,13052,100843,790734,6247708,49523566,393172015,3123669457, %T A251265 24825649060,197336983976,1568744380184,12471338622425,99147670133944, %U A251265 788235696873315,6266596802635677,49820538186135672,396082433072779827 %N A251265 Number of (n+1)X(5+1) 0..1 arrays with no 2X2 subblock having x11-x00 less than x10-x01. %C A251265 Column 5 of A251268 %H A251265 R. H. Hardin, <a href="/A251265/b251265.txt">Table of n, a(n) for n = 1..210</a> %F A251265 Empirical: a(n) = 11*a(n-1) +25*a(n-2) -557*a(n-3) +417*a(n-4) +10537*a(n-5) -19095*a(n-6) -98114*a(n-7) +246975*a(n-8) +493227*a(n-9) -1642630*a(n-10) -1333320*a(n-11) +6536456*a(n-12) +1447446*a(n-13) -16694903*a(n-14) +2009237*a(n-15) +28399782*a(n-16) -9693504*a(n-17) -32722458*a(n-18) +16381621*a(n-19) +25543750*a(n-20) -16165287*a(n-21) -13265317*a(n-22) +10184940*a(n-23) +4371851*a(n-24) -4166286*a(n-25) -812484*a(n-26) +1089550*a(n-27) +50756*a(n-28) -174763*a(n-29) +8480*a(n-30) +15983*a(n-31) -1709*a(n-32) -738*a(n-33) +103*a(n-34) +13*a(n-35) -2*a(n-36) %e A251265 Some solutions for n=4 %e A251265 ..0..0..1..0..0..0....0..0..0..0..1..1....0..1..0..1..0..0....0..0..0..0..0..1 %e A251265 ..0..0..0..1..1..1....1..1..1..1..1..1....0..0..1..0..1..1....0..0..1..1..1..0 %e A251265 ..1..1..1..1..1..1....0..1..1..1..1..1....0..0..0..1..1..1....0..0..0..0..0..1 %e A251265 ..0..0..0..0..1..1....1..0..1..1..1..1....0..0..0..1..1..1....0..0..0..0..1..1 %e A251265 ..0..0..0..1..0..1....0..1..0..0..0..0....1..1..1..0..0..1....0..0..0..0..0..0 %K A251265 nonn %O A251265 1,1 %A A251265 _R. H. Hardin_, Dec 01 2014