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

 

Logo
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
Sequence in context: A276135 A350115 A211143 * A209982 A205220 A188250
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)