[seqfan] Occupancy count maps perfect squares

[Ron Hardin]

The top corner of this problem seems to have even columns equal to perfect 
squares, as far as it's been computed.

Can it be seen why this might be?

T(n,k)=Number of nXk arrays of occupancy after each element moves to some 
horizontal, diagonal or antidiagonal neighbor

Table starts
.0......1.......2.........4.........8.......16.........32......64.128
.0......9......50.......484......3864....32400.....267264.2214144....
.0.....64....1056.....45369...1337130.44315649.1404725868............
.0....441...21660...4096576.438377904................................
.0...3025..441720.367565584..........................................
.0..20736.8997120....................................................
.0.142129............................................................
.0...................................................................

sqrt of the table, with comma for decimal point (because the program already 
uses periods)
Table starts
.0...1....1,414.....2.....2,828....4.....5,656....8.11,313
.0...3....7,071....22....62,161..180...516,975.1488.......
.0...8...32,496...213..1156,343.6657.37479,672............
.0..21..147,173..2024.20937,476...........................
.0..55..664,620.19172.....................................
.0.144.2999,519...........................................
.0.377....................................................
.0........................................................


 rhhardin at mindspring.com
rhhardin at att.net (either)