Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
The OEIS is supported by the many generous donors to the OEIS Foundation.
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A305190
a(n) is the number of different numbers of Hamiltonian cycles (up to direction) in graphs with n vertices.
3
1, 1, 2, 3, 6, 16, 49, 232, 1351, 10367
(list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
Table of n, a(n) for n=1..10.
Erich Friedman, Math Magic (September 2012)
EXAMPLE
A graph on 4 vertices can have either 0, 1 or 3 Hamiltonian cycles (up to direction), which are 3 numbers, so a(4)= 3.
CROSSREFS
Cf. A244511.
Sequence in context: A284417 A219024 A145860 * A087983 A340911 A328409
Adjacent sequences: A305187 A305188 A305189 * A305191 A305192 A305193
KEYWORD
nonn,more
AUTHOR
Johan de Ruiter, May 27 2018
STATUS
approved

Lookup Welcome Wiki Register Music Plot 2 Demos Index WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified October 21 05:07 EDT 2024. Contains 376969 sequences.
License Agreements, Terms of Use, Privacy Policy