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 A303243 #6 Apr 02 2025 21:47:54 %S A303243 4,2,18,8,60,56,236,428,1248,3264,8624,24720,65816,187464,509576, %T A303243 1428608,3932112,10932480,30245800,83854984,232353544,643805072, %U A303243 1784418352,4944349600,13703715720,37974373160,105243781928,291657188656 %N A303243 Number of 3 X n 0..1 arrays with every element equal to 0, 2, 3, 5 or 6 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero. %C A303243 Row 3 of A303242. %H A303243 R. H. Hardin, <a href="/A303243/b303243.txt">Table of n, a(n) for n = 1..210</a> %F A303243 Empirical: a(n) = 3*a(n-1) +9*a(n-2) -28*a(n-3) -37*a(n-4) +117*a(n-5) +85*a(n-6) -280*a(n-7) -118*a(n-8) +424*a(n-9) +92*a(n-10) -428*a(n-11) -26*a(n-12) +300*a(n-13) +12*a(n-14) -172*a(n-15) +48*a(n-16) +24*a(n-17) -48*a(n-18) +8*a(n-20). %e A303243 Some solutions for n=5 %e A303243 ..0..1..0..0..1. .0..1..0..1..1. .0..0..1..1..0. .0..0..1..1..1 %e A303243 ..0..1..0..0..1. .1..1..1..1..1. .0..0..0..1..1. .1..0..0..1..0 %e A303243 ..1..1..1..0..0. .0..1..0..1..0. .1..0..1..1..0. .1..0..0..1..0 %Y A303243 Cf. A303242. %K A303243 nonn %O A303243 1,1 %A A303243 _R. H. Hardin_, Apr 20 2018