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 A299650 #4 Feb 15 2018 14:39:20 %S A299650 8,128,1924,29408,448993,6856789,104711327,1599074414,24419877459, %T A299650 372922269561,5694992480926,86969703985622,1328136856258967, %U A299650 20282321638150114,309736582562177245,4730067508487376056 %N A299650 Number of nX4 0..1 arrays with every element equal to 0, 1, 2, 3, 4, 5 or 6 king-move adjacent elements, with upper left element zero. %C A299650 Column 4 of A299654. %H A299650 R. H. Hardin, <a href="/A299650/b299650.txt">Table of n, a(n) for n = 1..210</a> %F A299650 Empirical: a(n) = 13*a(n-1) +31*a(n-2) +61*a(n-3) -43*a(n-4) -428*a(n-5) -273*a(n-6) +69*a(n-7) +545*a(n-8) +212*a(n-9) -84*a(n-10) -204*a(n-11) -32*a(n-12) +16*a(n-13) +24*a(n-14) %e A299650 Some solutions for n=5 %e A299650 ..0..0..0..0. .0..0..0..1. .0..0..0..0. .0..0..0..1. .0..0..0..1 %e A299650 ..0..0..0..0. .0..1..0..1. .0..0..0..0. .1..0..0..0. .0..0..0..0 %e A299650 ..0..1..1..1. .0..1..1..0. .0..1..1..1. .1..0..1..0. .1..0..1..0 %e A299650 ..1..1..0..0. .0..1..0..0. .1..1..1..1. .0..1..1..0. .0..1..0..0 %e A299650 ..0..1..1..0. .0..1..0..0. .1..0..0..1. .0..1..1..1. .1..1..1..1 %Y A299650 Cf. A299654. %K A299650 nonn %O A299650 1,1 %A A299650 _R. H. Hardin_, Feb 15 2018