login
The OEIS is supported by
the many generous donors to the OEIS Foundation
.
Hints
(Greetings from
The On-Line Encyclopedia of Integer Sequences
!)
A241768
Number of simple connected graphs with n nodes and exactly 2 articulation points (cutpoints).
8
0, 0, 0, 1, 3, 17, 101, 890, 11468, 239728
(
list
;
graph
;
refs
;
listen
;
history
;
text
;
internal format
)
OFFSET
1,5
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
Eric Weisstein's World of Mathematics,
Articulation Vertex
CROSSREFS
Column k=2 of
A325111
.
Cf. other simple connected graph sequences with k articulation points
A002218
,
A241767
,
A241768
,
A241769
,
A241770
,
A241771
.
Sequence in context:
A161940
A074565
A339565
*
A370286
A054365
A116886
Adjacent sequences:
A241765
A241766
A241767
*
A241769
A241770
A241771
KEYWORD
nonn
,
hard
,
more
AUTHOR
Travis Hoppe
and
Anna Petrone
, Apr 28 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 April 23 07:16 EDT 2024. Contains 371905 sequences. (Running on oeis4.)