|
%I #11 May 24 2021 00:34:26
%S 0,10,20,38,62,100,150,220,302,410,536,692,868,1080,1316,1594,1898,
%T 2248,2630,3064,3530,4054,4616,5240,5904,6636,7412,8262,9158,10132,
%U 11158,12268,13430,14682,15992,17396,18860,20424,22052
%N a(n) = Sum_{h=0..n, k=0..n} T(h,k), array T counting knights' moves as in A049604.
%F Conjecture: a(n) = a(n-1) + a(n-2) - 2*a(n-5) + a(n-8) + a(n-9) - a(n-10) for n > 11. - _Chai Wah Wu_, May 25 2016
%Y Partial sums of A047879.
%K nonn
%O 0,2
%A _Clark Kimberling_
|
