[seqfan] Re: 100 cities to visit

[Eric Angelini]

Many thanks to Franklin and Doug.
A sequence is now possible:
a(n) would be the minimal cost
for visiting cities "1", "2", "3",... "n" 
exactly once (no round-trip).
So a(1)=0, a(2)=21, a(3)=43, a(4)=83, ... a(100)=367, etc. Any taker?
Best,
É.



> 
> I think the minimal cost of a journey visiting all 100 cities exactly
> once is 367:
> 
> 100, 91, 92, 93, 94, 95, 96, 97, 98, 99, 90, 89, 88, 87, 86, 85, 84,
> 83, 82, 81, 80, 78, 79, 77, 76, 75, 74, 73, 72, 71, 70, 67, 68, 69,
> 66, 65, 64, 63, 62, 61, 60, 56, 58, 59, 57, 55, 54, 53, 52, 51, 50,
> 45, 47, 49, 48, 46, 44, 42, 40, 41, 43, 39, 38, 37, 36, 35, 34, 33,
> 31, 30, 32, 29, 9, 19, 18, 8, 28, 27, 7, 17, 16, 6, 26, 25, 5, 15, 14,
> 4, 24, 23, 22, 21, 20, 2, 12, 11, 1, 10, 13, 3
> 
> 
> Doug
> 
> _______________________________________________
> 
> Seqfan Mailing list - http://list.seqfan.eu/
>