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 A302071 #4 Mar 31 2018 15:46:32 %S A302071 8,128,884,7070,54177,420121,3247765,25151723,194858064,1509933667, %T A302071 11700696791,90670424899,702618377845,5444692727615,42191725016453, %U A302071 326949892917866,2533582903716510,19633107331640883,152139842374919901 %N A302071 Number of 4Xn 0..1 arrays with every element equal to 0, 1, 2 or 4 horizontally or antidiagonally adjacent elements, with upper left element zero. %C A302071 Row 4 of A302069. %H A302071 R. H. Hardin, <a href="/A302071/b302071.txt">Table of n, a(n) for n = 1..210</a> %F A302071 Empirical: a(n) = 9*a(n-1) -7*a(n-2) -29*a(n-3) +72*a(n-4) -52*a(n-5) -176*a(n-6) +353*a(n-7) -344*a(n-8) -507*a(n-9) +1488*a(n-10) -860*a(n-11) -872*a(n-12) +6458*a(n-13) +967*a(n-14) -10158*a(n-15) +2015*a(n-16) +9555*a(n-17) -22359*a(n-18) -15321*a(n-19) +31037*a(n-20) +1946*a(n-21) -35762*a(n-22) +6984*a(n-23) +54512*a(n-24) -8022*a(n-25) -4993*a(n-26) +14111*a(n-27) +19649*a(n-28) -10813*a(n-29) -13238*a(n-30) +10142*a(n-31) -41279*a(n-32) +14522*a(n-33) -20026*a(n-34) -4521*a(n-35) -2506*a(n-36) +13706*a(n-37) -2834*a(n-38) +7163*a(n-39) +1796*a(n-40) +817*a(n-41) -1442*a(n-42) +116*a(n-43) -719*a(n-44) -133*a(n-45) +120*a(n-46) -123*a(n-47) -23*a(n-48) -a(n-49) -7*a(n-50) -20*a(n-51) +10*a(n-52) +8*a(n-53) for n>58 %e A302071 Some solutions for n=5 %e A302071 ..0..1..0..1..1. .0..1..1..0..1. .0..0..1..0..0. .0..1..0..1..1 %e A302071 ..0..1..0..1..0. .1..0..1..0..0. .1..0..0..1..0. .0..0..1..0..0 %e A302071 ..0..1..0..0..1. .0..0..1..1..1. .0..1..0..0..1. .1..0..1..0..1 %e A302071 ..0..0..1..0..0. .0..1..0..0..0. .1..1..1..0..1. .1..1..0..0..0 %Y A302071 Cf. A302069. %K A302071 nonn %O A302071 1,1 %A A302071 _R. H. Hardin_, Mar 31 2018