login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A301648 Number of longest cycles in the n X n grid graph. 1
0, 1, 5, 6, 226, 1072, 255088, 4638576 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

a(10) = 467260456608.

LINKS

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

Eric Weisstein's World of Mathematics, Graph Cycle

Eric Weisstein's World of Mathematics, Grid Graph

FORMULA

a(2n) = A003763(n).

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).

Sequence in context: A041411 A103089 A041601 * A041827 A042089 A156191

Adjacent sequences:  A301645 A301646 A301647 * A301649 A301650 A301651

KEYWORD

nonn

AUTHOR

Eric W. Weisstein, Mar 25 2018

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 December 15 00:30 EST 2019. Contains 329988 sequences. (Running on oeis4.)