login
The OEIS is supported by
the many generous donors to the OEIS Foundation
.
Hints
(Greetings from
The On-Line Encyclopedia of Integer Sequences
!)
A243271
Number of graphs with n nodes that are Hamiltonian and distance-regular.
0
1, 0, 1, 2, 2, 4, 2, 5, 4, 6
(
list
;
graph
;
refs
;
listen
;
history
;
text
;
internal format
)
OFFSET
1,4
LINKS
Table of n, a(n) for n=1..10.
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
CROSSREFS
Cf.
A003216
(Hamiltonian graphs),
A241814
(distance-regular graphs).
Sequence in context:
A366708
A294097
A233520
*
A232245
A121895
A139555
Adjacent sequences:
A243268
A243269
A243270
*
A243272
A243273
A243274
KEYWORD
nonn
,
more
AUTHOR
Travis Hoppe
and
Anna Petrone
, Jun 02 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 September 17 14:42 EDT 2024. Contains 375987 sequences. (Running on oeis4.)