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 A269106 #6 May 25 2024 21:15:23 %S A269106 756,132300,17593092,2085484068,232068730044,24808345933548, %T A269106 2579398703502996,262780733311913580,26357371124964908460, %U A269106 2611360040338484328156,256155579492309832819860 %N A269106 Number of n X 5 0..3 arrays with some element plus some horizontally or vertically adjacent neighbor totalling three no more than once. %C A269106 Column 5 of A269109. %H A269106 R. H. Hardin, <a href="/A269106/b269106.txt">Table of n, a(n) for n = 1..210</a> %F A269106 Empirical: a(n) = 236*a(n-1) -19546*a(n-2) +707906*a(n-3) -13261621*a(n-4) +137719076*a(n-5) -784626841*a(n-6) +2025590366*a(n-7) +1091882414*a(n-8) -18874661724*a(n-9) +33829878231*a(n-10) +10605114324*a(n-11) -91783964484*a(n-12) +94503314304*a(n-13) -30762353664*a(n-14) for n>15. %e A269106 Some solutions for n=2 %e A269106 ..2..1..3..1..0. .0..0..0..2..3. .3..3..1..0..1. .0..1..3..3..3 %e A269106 ..0..1..1..0..2. .2..0..2..0..2. .2..1..3..1..1. .1..3..1..1..2 %Y A269106 Cf. A269109. %K A269106 nonn %O A269106 1,1 %A A269106 _R. H. Hardin_, Feb 19 2016