A047879 - cp's OEIS frontend

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.

n	a(n)
0	0
1	10
2	10
3	18
4	24
5	38
6	50
7	70
8	82
9	108
10	126
11	156
12	176
13	212
14	236
15	278
16	304
17	350
18	382
19	434
20	466
21	524
22	562
23	624
24	664
25	732
26	776
27	850
28	896
29	974
30	1026
31	1110
32	1162
33	1252
34	1310
35	1404
36	1464
37	1564
38	1628
39	1734
40	1800
41	1910
42	1982
43	2098
44	2170

[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]

cp's OEIS Frontend

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.

Table of values

List of values