The OEIS mourns the passing of
Jim Simons
and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by
the many generous donors to the OEIS Foundation
.
Hints
(Greetings from
The On-Line Encyclopedia of Integer Sequences
!)
A243250
Number of unlabeled, connected graphs on n vertices with at least one subgraph isomorphic to a diamond graph.
0
0, 0, 0, 2, 10, 73, 688, 10150, 253396, 11629559
(
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 [math.CO], 2014
Eric Weisstein's World of Mathematics,
Diamond Graph
FORMULA
a(n) =
A001349
(n) -
A242790
(n).
CROSSREFS
Sequence in context:
A231039
A224799
A275550
*
A088189
A228609
A001395
Adjacent sequences:
A243247
A243248
A243249
*
A243251
A243252
A243253
KEYWORD
nonn
,
more
AUTHOR
Travis Hoppe
and
Anna Petrone
, Jun 01 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 May 19 10:22 EDT 2024. Contains 372683 sequences. (Running on oeis4.)