A242511 -id:A242511 - cp's OEIS frontend

A183043 Triangular array, T(i,j)=number of knight's moves to points on vertical segments (n,0), (n,1),...,(n,n) on infinite chessboard.

0, 3, 2, 2, 1, 4, 3, 2, 3, 2, 2, 3, 2, 3, 4, 3, 4, 3, 4, 3, 4, 4, 3, 4, 3, 4, 5, 4, 5, 4, 5, 4, 5, 4, 5, 6, 4, 5, 4, 5, 4, 5, 6, 5, 6, 5, 6, 5, 6, 5, 6, 5, 6, 7, 6, 6, 5, 6, 5, 6, 5, 6, 7, 6, 7, 8, 7, 6, 7, 6, 7, 6, 7, 6, 7, 8, 7, 8, 6, 7, 6, 7, 6, 7, 6, 7, 8, 7, 8, 9, 8

Offset: 0

Clark Kimberling, Dec 20 2010

Stated another way, T(n,k) = distance from square (0,0) at center of an infinite open chessboard to square (n,k) via shortest knight path, for 0<=k<=n. - Fred Lunnon, May 18 2014

			Triangle starts:
0,
3,2,
2,1,4,
3,2,3,2,
2,3,2,3,4,
3,4,3,4,3,4,
4,3,4,3,4,5,4,
5,4,5,4,5,4,5,6,
4,5,4,5,4,5,6,5,6,
5,6,5,6,5,6,5,6,7,6
...
See examples under A242511.

Fred Lunnon, Knights in Daze, to appear.

Alois P. Heinz, Rows n = 0..140, flattened
Fred Lunnon, Revised tables & functions for knight's path distance and count (MAGMA code)

Cf. A065775, A183044, A183045, A183046, A018837, A018839, A242511, A242512, A242513, A242514, A242591.

// See link for recursive & explicit algorithms. - Fred Lunnon, May 18 2014

See A065775.

Edited by N. J. A. Sloane, May 23 2014

Offset corrected by Alois P. Heinz, Sep 10 2014

A242514 a(n) is the maximal number of shortest knight's move paths, from origin at center of an infinite open chessboard, to square with coordinates <= n.

Original entry on oeis.org

1, 12, 54, 54, 54, 54, 85, 240, 240, 588, 1512, 1512, 3564, 8700, 8700, 19965, 47124, 47124, 105963, 244244, 244244, 540540, 1224080, 1224080, 2674984, 5974956, 5974956, 12924522, 28553200, 28553200, 61250490, 134104432, 134104432, 285689624, 620826672, 620826672, 1314933000, 2839363800, 2839363800, 5984393805, 12852021420, 12852021420, 26973910215, 57655813500, 57655813500, 120569654700, 256649540640, 256649540640, 535009931280, 1134692142540, 1134692142540, 2358818719950, 4986548028000, 4986548028000, 10340761857030, 21796919253120, 21796919253120, 45102668144040, 94821703158000, 94821703158000, 195825873726600, 410720543218440, 410720543218440, 846739738410930, 1772108740270440, 1772108740270440, 3647615648094990, 7618942347630120, 7618942347630120, 15660031688889048, 32650847564232672

Offset: 0

Fred Lunnon, May 16 2014 and May 18 2014

For n > 5 the distinct terms of this sequence are conjectured to be identical to A242512: precisely, A242514(n) = A242512(ceiling(2*(n+1)/3)).

			For n=7, there are 240 shortest paths of length 6 steps from (0,0) to (7,7);
no square within 0 <= x,y <= 7 has more shortest paths.

Fred Lunnon, Knights in Daze, to appear.

Fred Lunnon, Revised tables & functions for knight's path distance and count (MAGMA code)

Cf. A242511, A242512, A242513, A183043, A242591.

A242591 Triangle of number of shortest knight paths T(n,k) from square (0,0) at center of an infinite open chessboard to square (n,k), for 0 <= k <= n.

Original entry on oeis.org

1, 12, 2, 2, 1, 54, 6, 2, 9, 2, 2, 6, 1, 3, 32, 6, 28, 6, 24, 3, 8, 24, 3, 18, 1, 12, 85, 6, 100, 16, 95, 12, 60, 4, 25, 240, 6, 70, 4, 50, 1, 30, 201, 10, 60, 40, 330, 35, 266, 20, 150, 5, 66, 588, 20, 210, 10, 180, 5, 120, 1, 60, 462, 15, 147, 1512

Offset: 0

Fred Lunnon, May 18 2014

			Triangle starts:
    1;
   12,   2;
    2,   1, 54;
    6,   2,  9,   2;
    2,   6,  1,   3, 32;
    6,  28,  6,  24,  3,   8;
   24,   3, 18,   1, 12,  85,   6;
  100,  16, 95,  12, 60,   4,  25, 240;
    6,  70,  4,  50,  1,  30, 201,  10,  60;
   40, 330, 35, 266, 20, 150,   5,  66, 588, 20;
  ...
See examples under A242511.

Georg Fischer, Table of n, a(n) for n = 0..209
Fred Lunnon, Revised tables & functions for knight's path distance and count (MAGMA code)

Cf. A242511, A242512, A242513, A242514, A183043.

// See attached a-file for recursive & explicit algorithms.

a(66) ff. exported to b-file by Georg Fischer, Jul 16 2020

A242512 a(n) = number of knight's move paths of minimal length n steps, from origin at center of an infinite open chessboard to square (0,0) for n=0; to square (2,-1) for n=1; and to square ([(3n-3)/2], [(3n-4)/2]) for n>=2.

Original entry on oeis.org

1, 1, 2, 9, 32, 85, 240, 588, 1512, 3564, 8700, 19965, 47124, 105963, 244244, 540540, 1224080, 2674984, 5974956, 12924522, 28553200, 61250490, 134104432, 285689624, 620826672, 1314933000, 2839363800, 5984393805, 12852021420, 26973910215, 57655813500, 120569654700, 256649540640, 535009931280, 1134692142540, 2358818719950, 4986548028000, 10340761857030, 21796919253120, 45102668144040, 94821703158000

Offset: 0

Fred Lunnon, May 16 2014 and May 18 2014

[x] denotes floor(x), the largest integer <= x. E.g., [-1/2] = -1.

The squares concerned constitute an infinite, locally fully concertinaed knight path from the origin, which hugs the diagonal x=y and is minimal to each square.

			See also examples for A242511.
For n=3, there are a(3)=9 minimal paths of 3 steps from (0,0) to (3,2).

Fred Lunnon, Knights in Daze, to appear.

Fred Lunnon, Revised tables & functions for knight's path distance and count (MAGMA code)

Cf. A242511, A242513, A242514, A183043, A242591.

[ Max(1, Binomial(d, d div 2 - 1)/2 * // diagonal-hugging path
  ( /*if*/ IsEven(d) select (d^3-d^2+30*d-40)/(d+4)
  else d*(d^2+2*d+33)/(d+5) /*end if*/ )) : d in [0..20] ];

a(n) = max(1, binomial(n, (n\2 - 1))/2 * if (n%2, n*(n^2+2*n+33)/(n+5), (n^3-n^2+30*n-40)/(n+4))); \\ Michel Marcus, May 17 2014

For n>=2, a(n) = binomial(n,[n/2]-1)/2 *

( (n^3-n^2+30n-40)/(n+4) if n even, n(n^2+2n+33)/(n+5) if n odd ).

A242513 a(n) = maximal number of shortest knight's move paths, from origin at center of an infinite open chessboard, to any square within n moves.

Original entry on oeis.org

1, 1, 2, 12, 54, 100, 330, 1050, 3024, 8736, 23220, 62700, 158004, 406692, 986986, 2452450, 5788640, 14002560, 32357052, 76640148, 174174520, 405623400, 909582212, 2089064516, 4633556448, 10519464000, 23120533800, 51977741400, 113365499940, 252725219460, 547593359850, 1211884139250, 2610998927040, 5741708459520, 12309472580460, 26917328938500

Offset: 0

Fred Lunnon, May 16 2014 and May 18 2014

For n>4 this sequence is conjectured to be identical to A242511.

The same sequence results after replacing 'within n moves' with 'at shortest distance n moves'.

			For n=5, there are 100 shortest paths of length 5 steps from (0,0) to (7,0); no square at 5 (or fewer) moves from the origin has more shortest paths.

Fred Lunnon, Knights in Daze, to appear.

Fred Lunnon, Revised tables & functions for knight's path distance and count (MAGMA code)

Cf. A242511, A242512, A242514, A183043, A242591.

cp's OEIS Frontend

A183043 Triangular array, T(i,j)=number of knight's moves to points on vertical segments (n,0), (n,1),...,(n,n) on infinite chessboard.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Formula

Extensions

A242514 a(n) is the maximal number of shortest knight's move paths, from origin at center of an infinite open chessboard, to square with coordinates <= n.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

A242591 Triangle of number of shortest knight paths T(n,k) from square (0,0) at center of an infinite open chessboard to square (n,k), for 0 <= k <= n.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Magma

Extensions

A242512 a(n) = number of knight's move paths of minimal length n steps, from origin at center of an infinite open chessboard to square (0,0) for n=0; to square (2,-1) for n=1; and to square ([(3n-3)/2], [(3n-4)/2]) for n>=2.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

PARI

Formula

A242513 a(n) = maximal number of shortest knight's move paths, from origin at center of an infinite open chessboard, to any square within n moves.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs