a(n) is the number of different pairs of shortest paths in an n X n lattice going between opposite corners in opposite directions and not meeting at their middle point.
A357603
a(n) is the number of different pairs of shortest paths in an n X n lattice going between opposite corners in opposite directions and not meeting at their middle point.
Terms
- a(0) =0a(1) =2a(2) =18a(3) =236a(4) =3090a(5) =42252a(6) =589932a(7) =8383608a(8) =120720402a(9) =1756863020a(10) =25789460268a(11) =381298472568
External references
- oeis: A357603