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 A269288 #4 Feb 21 2016 09:26:35 %S A269288 8748,11026764,10363900428,8642330207532,6751724437907820, %T A269288 5062027330721456172,3689070798270477232620,2633315774277280991138604, %U A269288 1850184391068250712299997676,1283831257986363807652886516268 %N A269288 Number of nX7 0..3 arrays with some element plus some horizontally or antidiagonally adjacent neighbor totalling three no more than once. %C A269288 Column 7 of A269289. %H A269288 R. H. Hardin, <a href="/A269288/b269288.txt">Table of n, a(n) for n = 1..210</a> %F A269288 Empirical: a(n) = 1384*a(n-1) -566002*a(n-2) +61993580*a(n-3) -3083170217*a(n-4) +82564587476*a(n-5) -1288497445564*a(n-6) +12048887832352*a(n-7) -66380108132464*a(n-8) +198314583195456*a(n-9) -247475435747904*a(n-10) for n>11 %e A269288 Some solutions for n=1 %e A269288 ..2..1..1..1..1..3..1. .0..3..3..1..1..1..1. .2..0..2..1..1..0..0 %Y A269288 Cf. A269289. %K A269288 nonn %O A269288 1,1 %A A269288 _R. H. Hardin_, Feb 21 2016