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 A217273 #6 Jul 22 2025 23:39:13 %S A217273 0,1,1,2,9,2,4,64,64,4,8,441,1472,441,8,16,3025,33856,33856,3025,16, %T A217273 32,20736,772800,2572816,772800,20736,32,64,142129,17640000,194881600, %U A217273 194881600,17640000,142129,64,128,974169,402494400,14755689729 %N A217273 T(n,k)=Number of nXk arrays of occupancy after each element moves to some horizontal or vertical neighbor. %C A217273 Table starts %C A217273 ....0..........1...............2..................4.....................8 %C A217273 ....1..........9..............64................441..................3025 %C A217273 ....2.........64............1472..............33856................772800 %C A217273 ....4........441...........33856............2572816.............194881600 %C A217273 ....8.......3025..........772800..........194881600...........48909857500 %C A217273 ...16......20736........17640000........14755689729........12276607432401 %C A217273 ...32.....142129.......402494400......1117092569476......3080781263731464 %C A217273 ...64.....974169......9183772224.....84567501131481....773143936621737444 %C A217273 ..128....6677056....209543184576...6401965110822961.194021789111058265560 %C A217273 ..256...45765225...4781079618624.484642857129680209 %C A217273 ..512..313679521.109088244863424 %C A217273 .1024.2149991424 %H A217273 R. H. Hardin, <a href="/A217273/b217273.txt">Table of n, a(n) for n = 1..97</a> %e A217273 Some solutions for n=3 k=4 %e A217273 ..0..1..0..2....0..2..2..1....0..2..2..1....1..0..0..1....1..0..1..1 %e A217273 ..1..1..2..2....1..0..1..1....1..2..1..0....1..1..1..1....3..1..2..0 %e A217273 ..2..0..1..0....1..1..2..0....0..1..2..0....0..2..3..1....1..0..2..0 %Y A217273 Column 2 is A049684 %K A217273 nonn,tabl %O A217273 1,4 %A A217273 _R. H. Hardin_ Sep 29 2012