[go: up one dir, main page]
login
The OEIS is supported by the many generous donors to the OEIS Foundation.
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A243270
Number of graphs with n nodes that are Hamiltonian and bipartite.
0
1, 0, 0, 1, 0, 4, 0, 24, 0, 473, 0, 30512, 0, 6374556
(list; graph; refs; listen; history; text; internal format)
OFFSET
1,6
LINKS
Table of n, a(n) for n=1..14.
Travis Hoppe and Anna Petrone, Encyclopedia of Finite Graphs
T. Hoppe and A. Petrone, Integer sequence discovery from small graphs, arXiv preprint arXiv:1408.3644, 2014
F. Hüffner, tinygraph, software for generating integer sequences based on graph properties, version 4361e42
CROSSREFS
Cf. A003216 (Hamiltonian graphs), A005142 (bipartite graphs).
Sequence in context: A246132 A229827 A295839 * A242027 A329891 A357810
Adjacent sequences: A243267 A243268 A243269 * A243271 A243272 A243273
KEYWORD
nonn,more
AUTHOR
Travis Hoppe and Anna Petrone, Jun 02 2014
EXTENSIONS
a(11)-a(14) added using tinygraph by Falk Hüffner, Aug 13 2017
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 November 7 10:56 EST 2024. Contains 377535 sequences.
License Agreements, Terms of Use, Privacy Policy