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!)
A333606 Number of directed Hamiltonian walks from NW to SW corners of a 10 X n grid. 2
1, 1, 256, 1480, 117852, 1513468, 71154709 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

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

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

    return A271592(10, n)

print([A333606(n) for n in range(1, 8)])

CROSSREFS

Row n=10 of A271592.

Cf. A333585.

Sequence in context: A237482 A237150 A237143 * A237974 A237967 A237142

Adjacent sequences:  A333603 A333604 A333605 * A333607 A333608 A333609

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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 6 07:09 EDT 2022. Contains 357262 sequences. (Running on oeis4.)