The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 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
 0, 20, 52, 112, 200, 340, 524, 784, 1096, 1508, 1988, 2584, 3264, 4084, 4996, 6072, 7256, 8620, 10108, 11800, 13624, 15676, 17876, 20320, 22928, 25804, 28852, 32192, 35720, 39556, 43596, 47968, 52552, 57492, 62660, 68200, 73984 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS FORMULA See A065775. 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 EXAMPLE a(2)=52 counts the knight's moves to these points: 4 1 2 1 4 1 2 3 2 1 2 3 0 3 2 1 2 3 2 1 4 1 2 1 4 a(0)=0 for the center, and a(1)=20 for the square 2 3 2 3 0 3 2 3 2 CROSSREFS Cf. A065775, A183048. Sequence in context: A128905 A276135 A211143 * A209982 A205220 A188250 Adjacent sequences:  A183044 A183045 A183046 * A183048 A183049 A183050 KEYWORD nonn AUTHOR Clark Kimberling, Dec 20 2010 STATUS approved

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 December 3 15:15 EST 2021. Contains 349463 sequences. (Running on oeis4.)