OFFSET
0,2
LINKS
Seiichi Manyama, Table of n, a(n) for n = 0..200
PROG
(Python)
# Using graphillion
from graphillion import GraphSet
import graphillion.tutorial as tl
def A271592(n, k):
if k == 1: return 1
universe = tl.grid(k - 1, n - 1)
GraphSet.set_universe(universe)
start, goal = 1, n
paths = GraphSet.paths(start, goal, is_hamilton=True)
return paths.len()
def A333605(n):
return A271592(9, 2 * n + 1)
print([A333605(n) for n in range(15)])
CROSSREFS
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Mar 28 2020
STATUS
approved