A047881 a(n) = Sum_{h=0..n, k=0..n} T(h,k), array T counting knights' moves as in A049604.

0, 10, 20, 38, 62, 100, 150, 220, 302, 410, 536, 692, 868, 1080, 1316, 1594, 1898, 2248, 2630, 3064, 3530, 4054, 4616, 5240, 5904, 6636, 7412, 8262, 9158, 10132, 11158, 12268, 13430, 14682, 15992, 17396, 18860, 20424, 22052

Offset

0,2

Links

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

Formula

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

Crossrefs

Partial sums of A047879.

Sequence in context: A048011 A188334 A266087 * A172172 A275245 A020953

Adjacent sequences: A047878 A047879 A047880 * A047882 A047883 A047884

Keyword

nonn

Author

Clark Kimberling

Status

approved