a(n) is the maximal number of shortest knight's move paths, from origin at center of an infinite open chessboard, to square with coordinates <= n.

A242514

a(n) is the maximal number of shortest knight's move paths, from origin at center of an infinite open chessboard, to square with coordinates <= n.

Terms

    a(0) =1a(1) =12a(2) =54a(3) =54a(4) =54a(5) =54a(6) =85a(7) =240a(8) =240a(9) =588a(10) =1512a(11) =1512a(12) =3564a(13) =8700a(14) =8700a(15) =19965a(16) =47124a(17) =47124a(18) =105963a(19) =244244a(20) =244244a(21) =540540a(22) =1224080a(23) =1224080a(24) =2674984a(25) =5974956a(26) =5974956a(27) =12924522a(28) =28553200a(29) =28553200

External references