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 A220254 #6 Jul 23 2025 00:59:25 %S A220254 2,2,2,8,16,8,16,48,48,16,24,256,324,256,24,64,928,4096,4096,928,64, %T A220254 128,4096,31744,45792,31744,4096,128,232,15872,262144,1048576,1048576, %U A220254 262144,15872,232,512,65536,2011776,16777216,33350528,16777216,2011776,65536 %N A220254 T(n,k)=Sum of neighbor maps: number of nXk binary arrays indicating the locations of corresponding elements equal to the sum mod 3 of their king-move neighbors in a random 0..2 nXk array. %C A220254 Table starts %C A220254 ....2......2........8........16.........24.........64.......128........232 %C A220254 ....2.....16.......48.......256........928.......4096.....15872......65536 %C A220254 ....8.....48......324......4096......31744.....262144...2011776...16728064 %C A220254 ...16....256.....4096.....45792....1048576...16777216.268435456.4294967296 %C A220254 ...24....928....31744...1048576...33350528.1073741824 %C A220254 ...64...4096...262144..16777216.1073741824 %C A220254 ..128..15872..2011776.268435456 %C A220254 ..232..65536.16728064 %C A220254 ..512.259584 %C A220254 .1024 %H A220254 R. H. Hardin, <a href="/A220254/b220254.txt">Table of n, a(n) for n = 1..59</a> %e A220254 Some solutions for n=3 k=4 %e A220254 ..0..1..0..0....0..0..0..1....1..0..0..0....0..1..0..1....0..0..0..0 %e A220254 ..0..1..0..0....0..0..0..0....1..0..1..0....0..1..0..0....1..1..0..0 %e A220254 ..1..1..1..1....1..0..1..0....1..1..0..0....0..0..1..0....1..1..1..0 %Y A220254 Column 1 is A220172 %K A220254 nonn,tabl %O A220254 1,1 %A A220254 _R. H. Hardin_ Dec 08 2012