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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A047879 a(n)=Sum{T(n,i): i=0,1,...,n}+Sum{T(i,n): i=0,1,...,n-1}, array T counting least number of knight's moves as in A049604. 0
0, 10, 10, 18, 24, 38, 50, 70, 82, 108, 126, 156, 176, 212, 236, 278, 304, 350, 382, 434, 466, 524, 562, 624, 664, 732, 776, 850, 896, 974, 1026, 1110, 1162, 1252, 1310, 1404, 1464, 1564, 1628, 1734, 1800, 1910, 1982, 2098, 2170 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

Table of n, a(n) for n=0..44.

FORMULA

Empirical g.f.: 2*x*(x^10+3*x^9-x^8-4*x^7-5*x^6-4*x^5-2*x^3-4*x^2-5*x-5) / ((x-1)^3*(x+1)^2*(x^2+1)*(x^2+x+1)). - Colin Barker, May 04 2014

CROSSREFS

Cf. A049604.

Sequence in context: A272479 A167427 A227437 * A168416 A141324 A097041

Adjacent sequences:  A047876 A047877 A047878 * A047880 A047881 A047882

KEYWORD

nonn

AUTHOR

Clark Kimberling

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 26 11:07 EST 2020. Contains 331279 sequences. (Running on oeis4.)