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 A222386 #6 Jul 23 2025 02:33:36 %S A222386 2,2,4,8,16,8,16,48,64,16,24,248,512,232,32,64,1024,3968,3968,1024,64, %T A222386 128,3968,32768,63488,32768,4096,128,232,15872,262144,1048576,1048320, %U A222386 261376,16224,256,512,65536,2093824,16776896,33546240,16777216,2097152 %N A222386 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 horizontal and antidiagonal neighbors in a random 0..2 nXk array. %C A222386 Table starts %C A222386 ....2.......2.........8.........16..........24..........64.........128 %C A222386 ....4......16........48........248........1024........3968.......15872 %C A222386 ....8......64.......512.......3968.......32768......262144.....2093824 %C A222386 ...16.....232......3968......63488.....1048576....16776896...268369920 %C A222386 ...32....1024.....32768....1048320....33546240..1073741712.34359738368 %C A222386 ...64....4096....261376...16777216..1073741824.68719469568 %C A222386 ..128...16224...2097152..268435072.34359738368 %C A222386 ..256...65536..16773120.4294961152 %C A222386 ..512..262144.134217728 %C A222386 .1024.1047680 %C A222386 .2048 %H A222386 R. H. Hardin, <a href="/A222386/b222386.txt">Table of n, a(n) for n = 1..70</a> %e A222386 Some solutions for n=3 k=4 %e A222386 ..0..1..1..0....0..1..0..0....0..0..1..0....0..0..0..1....1..1..0..1 %e A222386 ..1..1..0..1....0..1..0..1....0..0..1..0....1..0..0..0....0..1..0..1 %e A222386 ..1..1..1..0....0..1..0..1....0..1..0..0....0..1..1..0....0..0..1..1 %Y A222386 Column 1 is A000079 %Y A222386 Row 1 is A220172 %K A222386 nonn,tabl %O A222386 1,1 %A A222386 _R. H. Hardin_ Feb 18 2013