OFFSET
1,2
LINKS
Seiichi Manyama, Table of n, a(n) for n = 1..400
PROG
(Python)
# Using graphillion
from graphillion import GraphSet
import graphillion.tutorial as tl
def A064298(n, k):
if n == 1 or k == 1: return 1
universe = tl.grid(n - 1, k - 1)
GraphSet.set_universe(universe)
start, goal = 1, k * n
paths = GraphSet.paths(start, goal)
return paths.len()
def A333812(n):
return A064298(n, 7)
print([A333812(n) for n in range(1, 20)])
CROSSREFS
KEYWORD
nonn
AUTHOR
Seiichi Manyama, Apr 06 2020
STATUS
approved