Problem

[Roberto Tauraso]

On Tue, 24 Jan 2006, Giovanni Resta wrote
> Hi,
> just curious about the easier chain (not loop) values.
> For  squares it is 15 (A107929).
> For  cubes I did find 305, i.e., 256, 87, 129, 214, ...,  264, 248, 95
> (as reported in the same Rivera's page you cited earlier).
> If this value is correct we have the beginning of a sequence: 2, 15, 305,...
> Do you know which is the value for 4th powers? I expect it is
> smaller than the loop value (9641).

I do not know any reference for 4th powers.
However I think that the minimal tour should be with n>= 5903.
Before the corresponding graph has at least 3 nodes of
degree 1 (take n>9).

Bye
Roberto