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 A297508 #8 Feb 28 2019 16:27:48 %S A297508 1,29,110,314,1829,8803,34757,157673,735144,3208028,14196017,64154943, %T A297508 286007061,1271032033,5685858000,25403326244,113255416409, %U A297508 505585282497,2257780807909,10075966019543,44971626813134,200763429520862 %N A297508 Number of 3 X n 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 1 or 2 neighboring 1s. %H A297508 R. H. Hardin, <a href="/A297508/b297508.txt">Table of n, a(n) for n = 1..210</a> %F A297508 Empirical: a(n) = 3*a(n-1) + a(n-2) + 32*a(n-3) - 15*a(n-4) - 65*a(n-5) - 74*a(n-6) + 56*a(n-7) + 24*a(n-8) - 3*a(n-9) + 12*a(n-10). %F A297508 Empirical g.f.: x*(1 + 26*x + 22*x^2 - 77*x^3 - 136*x^4 - 18*x^5 + 80*x^6 + 21*x^7 + 9*x^8 + 12*x^9) / (1 - 3*x - x^2 - 32*x^3 + 15*x^4 + 65*x^5 + 74*x^6 - 56*x^7 - 24*x^8 + 3*x^9 - 12*x^10). - _Colin Barker_, Feb 28 2019 %e A297508 Some solutions for n=7: %e A297508 ..1..0..0..0..0..0..0. .0..1..1..0..0..1..1. .1..1..0..1..0..1..0 %e A297508 ..0..1..0..1..0..0..1. .0..0..0..0..0..0..0. .0..0..1..0..0..0..1 %e A297508 ..0..0..1..0..0..1..0. .0..0..1..1..1..1..1. .0..0..0..0..1..1..0 %Y A297508 Row 3 of A297506. %K A297508 nonn %O A297508 1,2 %A A297508 _R. H. Hardin_, Dec 31 2017