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.

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.

Terms

    a(0) =0a(1) =10a(2) =10a(3) =18a(4) =24a(5) =38a(6) =50a(7) =70a(8) =82a(9) =108a(10) =126a(11) =156a(12) =176a(13) =212a(14) =236a(15) =278a(16) =304a(17) =350a(18) =382a(19) =434a(20) =466a(21) =524a(22) =562a(23) =624a(24) =664a(25) =732a(26) =776a(27) =850a(28) =896a(29) =974

External references