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 A302220 #4 Apr 03 2018 12:13:21 %S A302220 2,45,164,934,4237,21777,105585,523414,2578424,12726069,62802085, %T A302220 309849336,1529212139,7545987106,37239443170,183771070484, %U A302220 906898467298,4475474508545,22086156194245,108993766999235,537877222587527 %N A302220 Number of nX4 0..1 arrays with every element equal to 1, 2 or 3 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. %C A302220 Column 4 of A302224. %H A302220 R. H. Hardin, <a href="/A302220/b302220.txt">Table of n, a(n) for n = 1..210</a> %F A302220 Empirical: a(n) = 5*a(n-1) +11*a(n-2) -42*a(n-3) -95*a(n-4) +21*a(n-5) +327*a(n-6) +1255*a(n-7) +317*a(n-8) -5188*a(n-9) -6921*a(n-10) +6005*a(n-11) +22780*a(n-12) +10157*a(n-13) -27962*a(n-14) -42374*a(n-15) -2355*a(n-16) +48767*a(n-17) +45664*a(n-18) -6331*a(n-19) -46138*a(n-20) -32422*a(n-21) +6577*a(n-22) +23809*a(n-23) +15150*a(n-24) -2372*a(n-25) -6308*a(n-26) -2794*a(n-27) -68*a(n-28) +832*a(n-29) +20*a(n-30) for n>34 %e A302220 Some solutions for n=5 %e A302220 ..0..1..0..0. .0..0..0..1. .0..1..1..0. .0..1..1..0. .0..0..0..1 %e A302220 ..1..0..1..0. .0..1..1..0. .0..0..0..0. .0..0..0..0. .1..0..1..0 %e A302220 ..0..1..1..0. .1..1..0..0. .1..1..1..1. .1..1..1..1. .1..1..0..0 %e A302220 ..0..1..0..0. .1..1..0..1. .0..0..0..0. .0..1..0..0. .0..1..0..1 %e A302220 ..0..0..1..1. .0..0..1..1. .1..1..0..0. .0..0..1..1. .1..0..1..1 %Y A302220 Cf. A302224. %K A302220 nonn %O A302220 1,1 %A A302220 _R. H. Hardin_, Apr 03 2018