Number of shortest paths from one vertex of a cube (side = n units) to farthest vertex, along the grid on 3 surfaces meeting at another vertex.

A225050

Number of shortest paths from one vertex of a cube (side = n units) to farthest vertex, along the grid on 3 surfaces meeting at another vertex.

Terms

    a(0) =1a(1) =4a(2) =24a(3) =148a(4) =920a(5) =5754a(6) =36204a(7) =229128a(8) =1458072a(9) =9325030a(10) =59905274a(11) =386368008a(12) =2500651244a(13) =16234450288a(14) =105680341560a(15) =689579733648

External references