cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A333247 Number of self-avoiding closed paths on an n X n grid which pass through NW and SW corners.

Original entry on oeis.org

1, 4, 47, 1843, 232905, 92729439, 115234959344, 442748883422394
Offset: 2

Views

Author

Seiichi Manyama, Mar 23 2020

Keywords

Comments

a(11) = 188829168009674568016545. - Seiichi Manyama, Apr 07 2020

Examples

			a(2) = 1;
   +--*
   |  |
   +--*
a(3) = 4;
   +--*--*   +--*--*   +--*      +--*
   |     |   |     |   |  |      |  |
   *     *   *  *--*   *  *--*   *  *
   |     |   |  |      |     |   |  |
   +--*--*   +--*      +--*--*   +--*
		

Crossrefs

Programs

  • Python
    # Using graphillion
    from graphillion import GraphSet
    import graphillion.tutorial as tl
    def A333247(n):
        universe = tl.grid(n - 1, n - 1)
        GraphSet.set_universe(universe)
        cycles = GraphSet.cycles().including(1).including(n)
        return cycles.len()
    print([A333247(n) for n in range(2, 10)])