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 A269039 #4 Feb 18 2016 09:02:53 %S A269039 0,1944,12228,146064,1326576,13031664,119790816,1105914780,9987532176, %T A269039 89650751964,796324353216,7029528437100,61650349082232, %U A269039 537978900955440,4672818187679448,40427882184540648,348530963947264848 %N A269039 Number of 5Xn 0..2 arrays with some element plus some horizontally, diagonally or antidiagonally adjacent neighbor totalling two exactly once. %C A269039 Row 5 of A269035. %H A269039 R. H. Hardin, <a href="/A269039/b269039.txt">Table of n, a(n) for n = 1..210</a> %F A269039 Empirical: a(n) = 12*a(n-1) +26*a(n-2) -566*a(n-3) -123*a(n-4) +8804*a(n-5) -4121*a(n-6) -59620*a(n-7) +55115*a(n-8) +183692*a(n-9) -256127*a(n-10) -211910*a(n-11) +498819*a(n-12) -48036*a(n-13) -371692*a(n-14) +214008*a(n-15) +43848*a(n-16) -64656*a(n-17) +8640*a(n-18) +5184*a(n-19) -1296*a(n-20) for n>22 %e A269039 Some solutions for n=4 %e A269039 ..0..1..2..1. .0..0..0..1. .0..0..0..1. .2..1..0..0. .2..1..2..1 %e A269039 ..2..1..2..1. .1..1..0..1. .0..0..0..0. .2..1..0..0. .0..1..0..1 %e A269039 ..0..1..2..1. .0..0..0..1. .0..0..0..1. .2..1..0..1. .0..0..0..0 %e A269039 ..2..1..2..2. .0..1..0..1. .0..0..0..1. .0..1..2..2. .1..0..1..2 %e A269039 ..2..1..0..1. .0..1..2..1. .1..0..1..0. .2..1..2..1. .1..2..1..2 %Y A269039 Cf. A269035. %K A269039 nonn %O A269039 1,2 %A A269039 _R. H. Hardin_, Feb 18 2016