|
%I #24 Dec 05 2020 10:22:16
%S 1,2,10,92,1852,78032,6846876,1255156712,482338029046,387869817764474,
%T 652822489612455344,2300645402905295350788,16976857303773016457918252
%N Number of Hamiltonian walks on a Sierpinski fractal.
%H András Kaszanyitzky, <a href="https://arxiv.org/abs/1710.08480">The generalized Sierpinski Arrowhead Curve</a>, arXiv:1710.08480 [math.CO], 2017.
%H András Kaszanyitzky, <a href="https://arxiv.org/abs/1710.09475">Triangular fractal approximating graphs and their covering paths and cycles</a>, arXiv:1710.09475 [math.CO], 2017.
%H Jelena Stajic, Suncica Elezovic-Hadzic, <a href="https://arxiv.org/abs/cond-mat/0310777">Hamiltonian walks on Sierpinski and n-simplex fractals</a>, arXiv:cond-mat/0310777 [cond-mat.stat-mech], 2003-2005.
%o (Python)
%o # Using graphillion
%o from graphillion import GraphSet
%o def make_n_triangular_grid_graph(n):
%o s = 1
%o grids = []
%o for i in range(n + 1, 1, -1):
%o for j in range(i - 1):
%o a, b, c = s + j, s + j + 1, s + i + j
%o grids.extend([(a, b), (a, c), (b, c)])
%o s += i
%o return grids
%o def A293709(n):
%o universe = make_n_triangular_grid_graph(n - 1)
%o GraphSet.set_universe(universe)
%o start, goal = 1, n * (n + 1) // 2
%o paths = GraphSet.paths(start, goal, is_hamilton=True)
%o return paths.len()
%o print([A293709(n) for n in range(2, 10)]) # _Seiichi Manyama_, Dec 05 2020
%Y Cf. A112676.
%K nonn,walk,more
%O 2,2
%A _Michel Marcus_, Oct 25 2017
%E a(10)-a(14) from _Seiichi Manyama_, Dec 05 2020
| 