MAX(p_A093407)

[hv at crypt.org]

Does A135401(n) = A000898(floor(n/2)), for n =
all positive integers?

The rook problem on an n-by-n chessboard, as I
understand it, is directly connected to
permutations of (1,2,3,...n).
So maybe the connection between these two
sequences is obvious.


Thanks,
Leroy Quet





\/\/\/\///////\\\\\\\/\/\/\/
/\/\/\///////**\\\\\\\/\/\/\
\/\/\///////*/\*\\\\\\\/\/\/
/\/\/\\\\\\\*\/*///////\/\/\
\/\/\/\\\\\\\**///////\/\/\/
/\/\/\/\\\\\\\///////\/\/\/\


      ____________________________________________________________________________________
Be a better friend, newshound, and 
know-it-all with Yahoo! Mobile.  Try it now.  http://mobile.yahoo.com/;_ylt=Ahu06i62sR8HDtDypao8Wcj9tAcJ