a(n) = maximal number of shortest knight's move paths, from origin at center of an infinite open chessboard, to any square within n moves.

A242513

a(n) = maximal number of shortest knight's move paths, from origin at center of an infinite open chessboard, to any square within n moves.

Terms

    a(0) =1a(1) =1a(2) =2a(3) =12a(4) =54a(5) =100a(6) =330a(7) =1050a(8) =3024a(9) =8736a(10) =23220a(11) =62700a(12) =158004a(13) =406692a(14) =986986a(15) =2452450a(16) =5788640a(17) =14002560a(18) =32357052a(19) =76640148a(20) =174174520a(21) =405623400a(22) =909582212a(23) =2089064516a(24) =4633556448a(25) =10519464000a(26) =23120533800a(27) =51977741400a(28) =113365499940a(29) =252725219460

External references