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 A221255 #6 Jun 02 2025 08:13:28 %S A221255 0,1,0,2,4,0,4,8,16,0,8,81,30,64,0,16,392,2116,112,256,0,32,2500, %T A221255 22268,58081,418,1024,0,64,14112,488601,1319409,1612900,1560,4096,0, %U A221255 128,83521,7356420,103489929,78633756,44903401,5822,16384,0,256,484128,132273001 %N A221255 T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal or antidiagonal neighbor, with no occupancy greater than 2. %C A221255 Table starts %C A221255 .0.....1.....2...........4..............8.................16 %C A221255 .0.....4.....8..........81............392...............2500 %C A221255 .0....16....30........2116..........22268.............488601 %C A221255 .0....64...112.......58081........1319409..........103489929 %C A221255 .0...256...418.....1612900.......78633756........22466712321 %C A221255 .0..1024..1560....44903401.....4684821704......4919350997521 %C A221255 .0..4096..5822..1250753956...278802326676...1080371161000000 %C A221255 .0.16384.21728.34842328921.16577412686597.237502965724417600 %C A221255 Even columns are perfect squares %H A221255 R. H. Hardin, <a href="/A221255/b221255.txt">Table of n, a(n) for n = 1..126</a> %e A221255 Some solutions for n=3 k=4 %e A221255 ..1..2..1..0....0..2..2..0....0..2..2..1....0..2..2..1....1..1..0..1 %e A221255 ..0..2..1..2....0..2..1..0....0..1..1..1....1..0..1..1....1..1..1..1 %e A221255 ..2..0..1..0....2..1..1..1....2..1..1..0....1..1..1..1....1..1..2..1 %Y A221255 Column 2 is A000302(n-1) %Y A221255 Column 3 is A052530 %K A221255 nonn,tabl %O A221255 1,4 %A A221255 _R. H. Hardin_ Jan 06 2013