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 A221290 #6 Oct 31 2023 19:11:29 %S A221290 1,1,1,2,4,1,4,16,12,1,7,52,92,37,1,12,200,673,556,114,1,21,792,5912, %T A221290 9107,3332,351,1,37,3080,48298,172904,123958,19996,1081,1,65,12164, %U A221290 396846,2890017,4983598,1686304,119972,3329,1,114,47827,3240527,49684593 %N A221290 T(n,k) = Equals two maps: number of n X k binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal and antidiagonal neighbors in a random 0..3 n X k array. %C A221290 Table starts %C A221290 .1.....1.......2.........4..........7..........12.........21........37 %C A221290 .1.....4......16........52........200.........792.......3080.....12164 %C A221290 .1....12......92.......673.......5912.......48298.....396846...3240527 %C A221290 .1....37.....556......9107.....172904.....2890017...49684593.821323042 %C A221290 .1...114....3332....123958....4983598...172905144.6138441061 %C A221290 .1...351...19996...1686304..143511784.10344276279 %C A221290 .1..1081..119972..22931365.4129628435 %C A221290 .1..3329..719836.311813067 %C A221290 .1.10252.4319012 %C A221290 .1.31572 %C A221290 .1 %H A221290 R. H. Hardin, <a href="/A221290/b221290.txt">Table of n, a(n) for n = 1..70</a> %e A221290 Some solutions for n=3, k=4 %e A221290 ..0..0..1..0....0..0..0..0....0..1..0..0....0..0..0..1....0..0..0..1 %e A221290 ..0..0..1..0....0..1..0..0....1..0..1..0....0..0..0..0....1..0..0..0 %e A221290 ..0..1..0..0....1..0..1..0....1..1..1..0....1..1..0..0....1..1..0..0 %Y A221290 Column 2 is A099098. %Y A221290 Column 3 is A220932. %Y A221290 Column 4 is A220933. %Y A221290 Row 1 is A005251(n+1). %Y A221290 Row 2 is A220936. %K A221290 nonn,tabl %O A221290 1,4 %A A221290 _R. H. Hardin_, Jan 09 2013