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.

Showing 1-1 of 1 results.

A366411 a(n) is the total number of Hamiltonian paths on rectangular grids of size n X k for 1 <= k <= n.

Original entry on oeis.org

1, 5, 29, 353, 5485, 260323, 15277779, 3211933481, 790502793321, 751204032996623, 808973740240335345, 3499358510266725179221, 16872857815987642169925097, 333905047994165804391613820789, 7308582206982080422190512432243395
Offset: 1

Views

Author

Douglas Boffey, Oct 09 2023

Keywords

Examples

			For n = 2, the a(2) = 5 solutions are:
  +---+  +---+---+  +---+---+  +---+---+  +---+---+
  |   |  |   |   |  |   |   |  |   |   |  |   |   |
  | * |  | **|** |  | * | * |  | **|** |  | **|** |
  | * |  |   | * |  | * | * |  | * |   |  | * | * |
  +---+  +---+---+  +---+---+  +---+---+  +---+---+
  | * |  |   | * |  | * | * |  | * |   |  | * | * |
  | * |  | **|** |  | **|** |  | **|** |  | * | * |
  |   |  |   |   |  |   |   |  |   |   |  |   |   |
  +---+  +---+---+  +---+---+  +---+---+  +---+---+

Crossrefs

Row sums of triangle A366399.

Extensions

More terms (using A332307) from Pontus von Brömssen, Oct 09 2023
Showing 1-1 of 1 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.