cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A241769 Number of simple connected graphs with n nodes and exactly 3 articulation points (cutpoints).

This page as a plain text file.
%I A241769 #15 Feb 16 2025 08:33:22
%S A241769 0,0,0,0,1,5,32,242,2461,35839
%N A241769 Number of simple connected graphs with n nodes and exactly 3 articulation points (cutpoints).
%H A241769 Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a>
%H A241769 Travis Hoppe and Anna Petrone, <a href="http://arxiv.org/abs/1408.3644">Integer sequence discovery from small graphs</a>, arXiv preprint arXiv:1408.3644 [math.CO], 2014.
%H A241769 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ArticulationVertex.html">Articulation Vertex</a>
%Y A241769 Column k=3 of A325111.
%Y A241769 Cf. other simple connected graph sequences with k articulation points A002218, A241767, A241768, A241769, A241770, A241771.
%K A241769 nonn,more
%O A241769 1,6
%A A241769 _Travis Hoppe_ and _Anna Petrone_, Apr 28 2014