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 A220805 #6 Jul 23 2025 01:30:40 %S A220805 2,2,2,8,16,8,16,48,48,16,24,256,512,256,24,64,928,4096,4096,928,64, %T A220805 128,4096,30766,62648,30766,4096,128,232,15820,262144,1048576,1048576, %U A220805 262144,15820,232,512,65536,2097152,16777216,33358976,16777216,2097152,65536 %N A220805 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 and vertical neighbors in a random 0..3 nXk array. %C A220805 Table starts %C A220805 ....2......2........8........16.........24.........64.........128........232 %C A220805 ....2.....16.......48.......256........928.......4096.......15820......65536 %C A220805 ....8.....48......512......4096......30766.....262144.....2097152...16728064 %C A220805 ...16....256.....4096.....62648....1048576...16777216...268435456.4294967296 %C A220805 ...24....928....30766...1048576...33358976.1073741824.34348186888 %C A220805 ...64...4096...262144..16777216.1073741824 %C A220805 ..128..15820..2097152.268435456 %C A220805 ..232..65536.16728064 %C A220805 ..512.259584 %C A220805 .1024 %H A220805 R. H. Hardin, <a href="/A220805/b220805.txt">Table of n, a(n) for n = 1..60</a> %e A220805 Some solutions for n=3 k=4 %e A220805 ..0..1..0..0....1..1..1..0....0..1..0..1....1..0..1..0....1..1..0..1 %e A220805 ..1..0..0..1....1..0..0..0....0..1..0..0....1..0..1..1....1..0..1..1 %e A220805 ..1..0..0..0....1..0..1..1....0..1..1..1....1..0..1..0....1..0..1..0 %Y A220805 Column 1 is A220172 %K A220805 nonn,tabl %O A220805 1,1 %A A220805 _R. H. Hardin_ Dec 21 2012