login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A241769 Number of simple connected graphs with n nodes and exactly 3 articulation points (cutpoints). 5
0, 0, 0, 0, 1, 5, 32, 242, 2461, 35839 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,6

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

Cf. other simple connected graph sequences with k articulation points A002218, A241767, A241768, A241769, A241770, A241771.

Sequence in context: A053157 A102231 A127089 * A208046 A198598 A215916

Adjacent sequences:  A241766 A241767 A241768 * A241770 A241771 A241772

KEYWORD

nonn

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 21 11:54 EDT 2019. Contains 323443 sequences. (Running on oeis4.)