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 A221328 #6 Jun 02 2025 08:16:27 %S A221328 1,3,1,7,17,1,17,119,99,1,41,866,2008,577,1,99,6328,46105,33873,3363, %T A221328 1,239,46211,1010078,2460824,571358,19601,1,577,337274,22181855, %U A221328 162430981,131347807,9637322,114243,1,1393,2460918,487335857,10794156688 %N A221328 T(n,k)=Number of nXk arrays of occupancy after each element stays put or moves to some horizontal or antidiagonal neighbor, with no occupancy greater than 2. %C A221328 Table starts %C A221328 .1........3............7................17...................41 %C A221328 .1.......17..........119...............866.................6328 %C A221328 .1.......99.........2008.............46105..............1010078 %C A221328 .1......577........33873...........2460824............162430981 %C A221328 .1.....3363.......571358.........131347807..........26135748494 %C A221328 .1....19601......9637322........7010554450........4205264399891 %C A221328 .1...114243....162555929......374176705928......676612123702617 %C A221328 .1...665857...2741882383....19970973695923...108863121975329470 %C A221328 .1..3880899..46248186229..1065911268786396.17515379016294357354 %C A221328 .1.22619537.780082534460.56890876705125765 %H A221328 R. H. Hardin, <a href="/A221328/b221328.txt">Table of n, a(n) for n = 1..96</a> %e A221328 Some solutions for n=3 k=4 %e A221328 ..1..2..0..1....2..1..2..0....2..1..0..2....2..1..1..1....2..2..1..2 %e A221328 ..1..0..2..1....1..1..0..0....1..1..2..0....0..2..0..1....0..0..0..2 %e A221328 ..1..1..2..0....1..2..1..1....1..0..2..0....1..1..0..2....2..0..1..0 %Y A221328 Column 2 is A001541 %Y A221328 Row 1 is A001333 %K A221328 nonn,tabl %O A221328 1,2 %A A221328 _R. H. Hardin_ Jan 11 2013