[seqfan] Re: Occupancy count maps perfect squares

[franktaw at netscape.net]

Please explain better. I don't see how you get anything other than 
factors of 2, 3, 4, and 6 in these values, from the definitions given. 
Can you perhaps give an example?

Franklin T. Adams-Watters

-----Original Message-----
From: Ron Hardin <rhhardin at att.net>

It's not symmetric because there's no vertical movement.

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



----- Original Message ----
> From: Giovanni Resta <g.resta at iit.cnr.it>
>
> On 12/16/2012 07:43 PM, Ron Hardin wrote:
> > 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
>
> Honestly, I do  not understand what do you mean with that definition.
> At a certain point I  thought you mean
> "start with a matrix n x k filled with ones and count
> how  many configuration can be obtained if every one can be
> moved (added) to a  neighbouring cell.
>
> Hover, if that was the case, I would expect a  symmetric table of 
result,
> so I'm baffled.
> Could you please give me a  "for-dumbs" definition of the problem  ?
>
> Thanks,
> Giovanni
>
> _______________________________________________
>
> Seqfan  Mailing list - http://list.seqfan.eu/
>

_______________________________________________

Seqfan Mailing list - http://list.seqfan.eu/