A360444 - cp's OEIS frontend

A360444 a(n) is the number of ways for two nonintersecting, unordered pairs of shortest grid paths to cross over between two opposite corners in an n X n grid without intersecting opposite paths at their middle points.

n	a(n)
1	0
2	0
3	52
4	4540
5	742404
6	103625004
7	16451015760
8	2693403573732
9	463439672732740
10	82516389937797244
11	15153421065014201424
12	2855078861978328905660
13	550005952989718178915472
14	108007620360200608500699120
15	21569526154939330279935568704

[0, 0, 52, 4540, 742404, 103625004, 16451015760, 2693403573732, 463439672732740, 82516389937797244, 15153421065014201424, 2855078861978328905660, 550005952989718178915472, 108007620360200608500699120, 21569526154939330279935568704]

cp's OEIS Frontend

A360444 a(n) is the number of ways for two nonintersecting, unordered pairs of shortest grid paths to cross over between two opposite corners in an n X n grid without intersecting opposite paths at their middle points.

Table of values

List of values