cp's OEIS Frontend

A333812 Number of self-avoiding paths joining opposite corners of 7 X n board.

%I A333812 #10 Apr 06 2020 10:28:57
%S A333812 1,64,1369,29739,752061,20562673,575780564,16230458696,459133264944,
%T A333812 13021391001373,369886375079581,10516022622412960,299104709252534435,
%U A333812 8509249843020438582,242108399244641421526,6888987223916209602814,196026708756588099010848
%N A333812 Number of self-avoiding paths joining opposite corners of 7 X n board.
%H A333812 Seiichi Manyama, <a href="/A333812/b333812.txt">Table of n, a(n) for n = 1..400</a>
%o A333812 (Python)
%o A333812 # Using graphillion
%o A333812 from graphillion import GraphSet
%o A333812 import graphillion.tutorial as tl
%o A333812 def A064298(n, k):
%o A333812     if n == 1 or k == 1: return 1
%o A333812     universe = tl.grid(n - 1, k - 1)
%o A333812     GraphSet.set_universe(universe)
%o A333812     start, goal = 1, k * n
%o A333812     paths = GraphSet.paths(start, goal)
%o A333812     return paths.len()
%o A333812 def A333812(n):
%o A333812     return A064298(n, 7)
%o A333812 print([A333812(n) for n in range(1, 20)])
%Y A333812 Row 7 of A064298.
%K A333812 nonn
%O A333812 1,2
%A A333812 _Seiichi Manyama_, Apr 06 2020