A365629 Number of 4 X n mazes that can be navigated from the top left corner to the bottom right corner.

1, 216, 28942, 3329245, 358911148, 37502829018, 3856945416544

Offset

1,2

Comments

If the maze can be navigated in multiple ways, it is still only counted once.

Sample 4x3 maze that can be navigated from the top left corner to the bottom right corner:

+---+---+---+---+

| S---+ | |

+---+ | +---+ +

| +---+ | |

+ +---+ | +---+

| | +---F |

+---+---+---+---+

Sample 4x3 maze that cannot be navigated from the top left corner to the bottom right corner:

+---+---+---+---+

| S |

+---+ +---+ +

| | | |

+ +---+ +---+

| | F |

+---+---+---+---+

Links

Table of n, a(n) for n=1..7.

Eugene Nonko, Description of the problem and the approach to calculation.

Eugene Nonko, C program.

Steven B. Segletes, On the Electrical Connectivity of a 2-D, Randomly Distributed, Two-Component (Conducting/Insulating) Mixture, Devcom, ARL-TR-8899, Jan 2020; page 15 lists a(4).

Crossrefs

Cf. A349594, A349596.

Sequence in context: A229408 A269285 A133052 * A078204 A230466 A201248

Adjacent sequences: A365626 A365627 A365628 * A365630 A365631 A365632

Keyword

nonn,more

Author

Eugene Nonko, Oct 25 2023

Status

approved