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 A302684 #4 Apr 11 2018 12:31:23 %S A302684 32,14,18,64,125,453,2013,6725,21745,80985,295335,1015113,3570091, %T A302684 12835677,45416833,159687591,566457119,2010993911,7108904181, %U A302684 25146289499,89111146015,315554058131,1116679458873,3953641136991,14000618548225 %N A302684 Number of 6Xn 0..1 arrays with every element equal to 0, 1, 4 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. %C A302684 Row 6 of A302680. %H A302684 R. H. Hardin, <a href="/A302684/b302684.txt">Table of n, a(n) for n = 1..210</a> %F A302684 Empirical: a(n) = a(n-1) +2*a(n-2) +18*a(n-3) +31*a(n-4) -4*a(n-5) -56*a(n-6) -58*a(n-7) -38*a(n-8) +52*a(n-9) +7*a(n-10) -47*a(n-11) +10*a(n-12) +a(n-13) -32*a(n-14) +12*a(n-15) +2*a(n-16) +8*a(n-17) for n>23 %e A302684 Some solutions for n=5 %e A302684 ..0..1..0..1..0. .0..1..0..1..0. .0..1..1..1..0. .0..1..0..1..0 %e A302684 ..0..1..0..1..0. .0..1..0..0..0. .0..1..0..1..0. .0..1..0..1..0 %e A302684 ..0..1..0..1..0. .0..1..0..1..0. .0..1..0..1..0. .0..1..0..1..0 %e A302684 ..0..0..0..1..0. .0..1..1..1..0. .0..1..0..1..0. .0..1..0..1..0 %e A302684 ..0..1..0..1..0. .0..1..0..1..0. .0..1..0..1..0. .0..1..0..1..0 %e A302684 ..0..1..0..1..0. .0..1..0..0..0. .0..1..1..1..0. .0..1..0..0..0 %Y A302684 Cf. A302680. %K A302684 nonn %O A302684 1,1 %A A302684 _R. H. Hardin_, Apr 11 2018