|
Search: id:A047879
|
|
|
| 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. |
|
+0
1
|
|
| 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
(list; graph; listen)
|
|
|
|
|
Search completed in 0.002 seconds
|
