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

[David Applegate]

There are eight minimum paths (depending on how you count).  There are
three independent parts of the path where there are two independent
minimal routes (and actually, 2056,5 and 2056,6 are minimum):

2014,4
2018,1  2018,8
2019,9  2026,2
2028,8
2036,3
2039,9
2048,8
2056,5  2056,6
2061,6  2062,6
2067,7  2068,6
2074,7
2081,8
2089,8  2089,9
2097,9  2098,8
2106,6
2112

-Dave

> From seqfan-bounces at list.seqfan.eu Tue Apr 22 14:18:57 2014
> From: Hans Havermann <gladhobo at teksavvy.com>
> Date: Tue, 22 Apr 2014 14:18:40 -0400
> To: Sequence Fanatics Discussion list <seqfan at list.seqfan.eu>
> Subject: [seqfan] Re: From N to a palindrome by adding

> 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)?

> _______________________________________________

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