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 A222448 #6 Jul 23 2025 02:36:12 %S A222448 2,2,2,8,14,8,16,64,64,16,24,210,420,210,24,64,1024,4056,4056,1024,64, %T A222448 128,4000,32720,65536,32720,4000,128,232,16288,262104,1048576,1048576, %U A222448 262104,16288,232,512,65536,2082688,16750154,33553664,16750154,2082688 %N A222448 T(n,k)=Sum of neighbor maps: number of nXk binary arrays indicating the locations of corresponding elements equal to the sum mod 4 of their horizontal, vertical and antidiagonal neighbors in a random 0..3 nXk array. %C A222448 Table starts %C A222448 ....2......2........8........16.........24.........64.........128........232 %C A222448 ....2.....14.......64.......210.......1024.......4000.......16288......65536 %C A222448 ....8.....64......420......4056......32720.....262104.....2082688...16777216 %C A222448 ...16....210.....4056.....65536....1048576...16750154...268430848.4294967008 %C A222448 ...24...1024....32720...1048576...33553664.1073741824.34359738368 %C A222448 ...64...4000...262104..16750154.1073741824 %C A222448 ..128..16288..2082688.268430848 %C A222448 ..232..65536.16777216 %C A222448 ..512.260080 %C A222448 .1024 %H A222448 R. H. Hardin, <a href="/A222448/b222448.txt">Table of n, a(n) for n = 1..60</a> %e A222448 Some solutions for n=3 k=4 %e A222448 ..1..1..1..0....1..1..1..0....1..1..1..1....0..1..0..1....1..1..1..1 %e A222448 ..0..1..1..1....0..0..0..1....0..1..1..0....1..1..1..0....1..0..0..0 %e A222448 ..0..1..1..0....0..0..0..1....0..1..1..1....0..1..0..0....0..1..0..0 %Y A222448 Column 1 is A220172 %K A222448 nonn,tabl %O A222448 1,1 %A A222448 _R. H. Hardin_ Feb 20 2013