%I #9 May 04 2014 16:53:22

%S 0,10,10,18,24,38,50,70,82,108,126,156,176,212,236,278,304,350,382,

%T 434,466,524,562,624,664,732,776,850,896,974,1026,1110,1162,1252,1310,

%U 1404,1464,1564,1628,1734,1800,1910,1982,2098,2170

%N 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.

%F 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

%Y Cf. A049604.

%K nonn

%O 0,2

%A _Clark Kimberling_