[seqfan] Re: From N to a palindrome by adding

Hans Havermann gladhobo at teksavvy.com
Tue Apr 22 20:18:40 CEST 2014


It's possible there's more than one path. My code didn't actually calculate specific paths, just minimum number of steps for all possible paths.


On Apr 22, 2014, at 12:53 PM, Eric Angelini <Eric.Angelini at kntv.be> wrote:

> Mike:
>> Try change 2056,6, to 2056,5,
> 
> ... That's it, yes, many thanks!
> Hans, do you confirm (see below)?




More information about the SeqFan mailing list