login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A333602 Number of directed Hamiltonian walks from NW to SW corners of a 6 X n grid. 1
1, 1, 16, 47, 397, 1770, 11658, 59946, 359962, 1958968, 11341696, 63142224, 360314940, 2024278172, 11485023624, 64758162416, 366573071464, 2069908196378, 11706322628832 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Table of n, a(n) for n=1..19.

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 A333602(n):

    return A271592(6, n)

print([A333602(n) for n in range(1, 10)])

CROSSREFS

Row n=6 of A271592.

Cf. A333581.

Sequence in context: A204609 A233063 A208634 * A083307 A235765 A235548

Adjacent sequences:  A333599 A333600 A333601 * A333603 A333604 A333605

KEYWORD

nonn,more

AUTHOR

Seiichi Manyama, Mar 28 2020

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 20 16:32 EST 2022. Contains 350472 sequences. (Running on oeis4.)