The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A183047 Sums of least knight's moves from (0,0) to points in the square lattice [-n,n]x[-n,n]. 1

%I

%S 0,20,52,112,200,340,524,784,1096,1508,1988,2584,3264,4084,4996,6072,

%T 7256,8620,10108,11800,13624,15676,17876,20320,22928,25804,28852,

%U 32192,35720,39556,43596,47968,52552,57492,62660,68200,73984

%N Sums of least knight's moves from (0,0) to points in the square lattice [-n,n]x[-n,n].

%F See A065775.

%F Empirical g.f.: -4*x*(2*x^8+2*x^7-4*x^6-5*x^5-2*x^4-x^3-5*x^2-8*x-5) / ((x-1)^4*(x+1)^2*(x^2+x+1)). - _Colin Barker_, May 04 2014

%e a(2)=52 counts the knight's moves to these points:

%e 4 1 2 1 4

%e 1 2 3 2 1

%e 2 3 0 3 2

%e 1 2 3 2 1

%e 4 1 2 1 4

%e a(0)=0 for the center, and a(1)=20 for the square

%e 2 3 2

%e 3 0 3

%e 2 3 2

%Y Cf. A065775, A183048.

%K nonn

%O 0,2

%A _Clark Kimberling_, Dec 20 2010

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 16 17:49 EST 2022. Contains 350376 sequences. (Running on oeis4.)