A339795
Number of (undirected) paths in the graph C_3 X C_n.
Original entry on oeis.org
4536, 41676, 324570, 2298906, 15340836, 98401032, 614180286, 3759485910, 22684148388, 135385868268, 801141412422, 4708188092034, 27512477620020, 160001531341584, 926684449543278, 5347897587948078, 30765345147232932, 176489253686952180, 1009897820473377654
Offset: 3
-
# Using graphillion
from graphillion import GraphSet
def make_CnXCk(n, k):
grids = []
for i in range(1, k + 1):
for j in range(1, n):
grids.append((i + (j - 1) * k, i + j * k))
grids.append((i + (n - 1) * k, i))
for i in range(1, k * n, k):
for j in range(1, k):
grids.append((i + j - 1, i + j))
grids.append((i + k - 1, i))
return grids
def A(start, goal, n, k):
universe = make_CnXCk(n, k)
GraphSet.set_universe(universe)
paths = GraphSet.paths(start, goal)
return paths.len()
def B(n, k):
m = k * n
s = 0
for i in range(1, m):
for j in range(i + 1, m + 1):
s += A(i, j, n, k)
return s
def A339795(n):
return B(n, 3)
print([A339795(n) for n in range(3, 10)])
A339798
Number of (undirected) Hamiltonian paths in the graph C_4 X C_n.
Original entry on oeis.org
4128, 45696, 287160, 2172480, 11866848, 76468352, 390714840, 2301083680, 11288784144, 62812654272, 299720429528, 1604776566400, 7505573487360, 39105991164160, 180179056818584, 920223907284960, 4191443432295472, 21088555826121280, 95195388883597464, 473503955161244480
Offset: 3
-
# Using graphillion
from graphillion import GraphSet
def make_CnXCk(n, k):
grids = []
for i in range(1, k + 1):
for j in range(1, n):
grids.append((i + (j - 1) * k, i + j * k))
grids.append((i + (n - 1) * k, i))
for i in range(1, k * n, k):
for j in range(1, k):
grids.append((i + j - 1, i + j))
grids.append((i + k - 1, i))
return grids
def A(start, goal, n, k):
universe = make_CnXCk(n, k)
GraphSet.set_universe(universe)
paths = GraphSet.paths(start, goal, is_hamilton=True)
return paths.len()
def B(n, k):
m = k * n
s = 0
for i in range(1, m):
for j in range(i + 1, m + 1):
s += A(i, j, n, k)
return s
def A339798(n):
return B(n, 4)
print([A339798(n) for n in range(3, 10)])
A358869
Number of (undirected) paths in the graph C_5 X C_n.
Original entry on oeis.org
6690, 324570, 10489660, 276182500, 6486444750, 141606011050, 2938679135800, 58759814756160, 1142125726154350, 21713533582158110, 405578743418707380, 7468021173224848600, 135906384557097211050, 2449354951706961634050, 43785800216111451354800, 777390470051273329332440, 13722022446524862502553730
Offset: 2
a(2) prepended by
Ed Wynn, Jul 07 2023
A358872
Number of (undirected) paths in the graph C_6 X C_n.
Original entry on oeis.org
2298906, 136547568, 6486444750, 272445788808, 10588228608678, 390094527889632, 13820471174703870, 475213692224985720, 15959826206607422634, 525938391754196467536, 17064848263643902844850, 546612855015952410743736, 17320886593911945339408810, 543869852159220927372363456
Offset: 3
Showing 1-4 of 4 results.