A333603 - OEIS

%I #14 Mar 13 2023 16:21:59

%S 1,32,1584,88418,4999752,283163450,16039767268,908585449166,

%T 51467614908516,2915428131919456,165146980589118258,

%U 9354895388703582168,529916244425510621368,30017569886372177468776,1700371542421991554910438,96319035592388073867700014,5456076149237165677047910650

%N Number of directed Hamiltonian walks from NW to SW corners of a 7 X (2*n+1) grid.

%H Seiichi Manyama, <a href="/A333603/b333603.txt">Table of n, a(n) for n = 0..500</a>

%F Conjecture: a(n)= 85*a(n-1) -1932*a(n-2) +20403*a(n-3) -116734*a(n-4) +386724*a(n-5) -815141*a(n-6) +1251439*a(n-7) -1690670*a(n-8) +2681994*a(n-9) -4008954*a(n-10) +3390877*a(n-11) -1036420*a(n-12) -178842*a(n-13) +92790*a(n-14) +17732*a(n-15) -5972*a(n-16) +1728*a(n-17) +144*a(n-18). - _R. J. Mathar_, Mar 13 2023

%o (Python)

%o # Using graphillion

%o from graphillion import GraphSet

%o import graphillion.tutorial as tl

%o def A271592(n, k):

%o     if k == 1: return 1

%o     universe = tl.grid(k - 1, n - 1)

%o     GraphSet.set_universe(universe)

%o     start, goal = 1, n

%o     paths = GraphSet.paths(start, goal, is_hamilton=True)

%o     return paths.len()

%o def A333603(n):

%o     return A271592(7, 2 * n + 1)

%o print([A333603(n) for n in range(20)])

%Y Row n=7 of A271592 (with 0 omitted).

%Y Cf. A333582.

%K nonn

%O 0,2

%A _Seiichi Manyama_, Mar 28 2020