[seqfan] Re: knight's distnaces

[David Newman]

Thanks for the responses.  Now I can go back and see where I made mistakes
in my calculations.

<http://www.avg.com/email-signature?utm_medium=email&utm_source=link&utm_campaign=sig-email&utm_content=webmail>
Virus-free.
www.avg.com
<http://www.avg.com/email-signature?utm_medium=email&utm_source=link&utm_campaign=sig-email&utm_content=webmail>
<#DAB4FAD8-2DD7-40BB-A1B8-4E2AA1F9FDF2>

On Wed, Dec 27, 2017 at 2:18 PM, Sean A. Irvine <sairvin at gmail.com> wrote:

> The sequence you describe is already in the OEIS: https://oeis.org/A018840
>
>
> On 28 December 2017 at 05:47, David Newman <davidsnewman at gmail.com> wrote:
>
> > All this talk of queens has made me think of knights.  A018837 gives "the
> > number of steps for knight to reach (n,0) on an infinite chessboard.
> >
> > I'm thinking of an piece which I shall call a 3-2-knight because it may
> > move 3 boxes horizontally and then 2 boxes vertically, or it  may move 3
> > boxes vertically  and then 2 boxes horizontally.  (The ordinary chess
> > knight could be called a 2-1-knight by analogy.)
> >
> > I tried to compute a sequence analogous to A018837 . I got a sequence
> which
> > begins 0,7,4,5,2,7,2 which doesn't seem to be in the OEIS.  Could someone
> > check the computation?  Is this of interest?  What of i-j-knights for
> other
> > values?
> >
> > <http://www.avg.com/email-signature?utm_medium=email&
> > utm_source=link&utm_campaign=sig-email&utm_content=webmail>
> > Virus-free.
> > www.avg.com
> > <http://www.avg.com/email-signature?utm_medium=email&
> > utm_source=link&utm_campaign=sig-email&utm_content=webmail>
> > <#m_-3255507167644571178_DAB4FAD8-2DD7-40BB-A1B8-4E2AA1F9FDF2>
> >
> > --
> > Seqfan Mailing list - http://list.seqfan.eu/
> >
>
> --
> Seqfan Mailing list - http://list.seqfan.eu/
>