login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A001184 Number of simple Hamiltonian paths connecting opposite corners of a 2n+1 X 2n+1 grid. 12
1, 2, 104, 111712, 2688307514, 1445778936756068, 17337631013706758184626, 4628650743368437273677525554148, 27478778338807945303765092195103685118924 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

LINKS

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

FORMULA

a(n) = A121788(2n), n>0. - Ashutosh Mehra, Dec 19 2008

CROSSREFS

Cf. A121788, A333580.

Sequence in context: A199945 A346165 A265655 * A098653 A119433 A307227

Adjacent sequences: A001181 A001182 A001183 * A001185 A001186 A001187

KEYWORD

nonn,more,walk

AUTHOR

Don Knuth, Dec 07 1995

EXTENSIONS

a(7)-a(8) copied from A121788 by Alois P. Heinz, Sep 27 2014

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 December 7 21:25 EST 2022. Contains 358669 sequences. (Running on oeis4.)