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.

A301648 Number of longest cycles in the n X n grid graph.

Original entry on oeis.org

0, 1, 5, 6, 226, 1072, 255088, 4638576, 6663430912, 467260456608, 3916162476483538, 1076226888605605706, 51249820944023435573470, 56126499620491437281263608, 14870957102232406137455708164254, 65882516522625836326159786165530572, 95494789899510664733921727510895952184006
Offset: 1

Views

Author

Eric W. Weisstein, Mar 25 2018

Keywords

Comments

a(10) = 467260456608.

Links

Crossrefs

Cf. A137932 (circumference of the (n-1) X (n-1) grid graph).
Cf. A003763 (number of Hamiltonian cycles in the 2n X 2n grid graph).
Cf. A181584 (number of longest cycles in the (2n+1) X (2n+1) grid graph).

Formula

a(2n) = A003763(n).
a(2n+1) = A181584(n). - Andrew Howroyd, Mar 01 2020

Extensions

Terms a(9) and beyond from Andrew Howroyd, Mar 01 2020
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.