Original entry on oeis.org
2, 8, 98, 4112, 532270, 212372938, 263708907212, 1013068026356376, 11955420069208095720, 432101605951906251627394, 47778407166747833830058004150, 16149888968763663448192636077980754, 16675786862526496319891707194153887550752, 52568166380872328447478940416604864445574575710
Offset: 2
More terms from
Ed Wynn, Jun 29 2023
A333246
Number of self-avoiding closed paths on an n X n grid which pass through NW corner.
Original entry on oeis.org
1, 7, 97, 4111, 532269, 212372937, 263708907211, 1013068026356375, 11955420069208095719, 432101605951906251627393, 47778407166747833830058004149, 16149888968763663448192636077980753, 16675786862526496319891707194153887550751, 52568166380872328447478940416604864445574575709
Offset: 2
a(2) = 1;
+--*
| |
*--*
a(3) = 7;
+--* +--*--* +--*--* +--*
| | | | | | | |
*--* *--*--* * * * *
| | | |
*--*--* *--*
+--*--* +--*--* +--*
| | | | | |
* *--* *--* * * *--*
| | | | | |
*--* *--* *--*--*
-
# Using graphillion
from graphillion import GraphSet
import graphillion.tutorial as tl
def A333246(n):
universe = tl.grid(n - 1, n - 1)
GraphSet.set_universe(universe)
cycles = GraphSet.cycles().including(1)
return cycles.len()
print([A333246(n) for n in range(2, 10)])
Showing 1-2 of 2 results.