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.

A241767 Number of simple connected graphs with n nodes and exactly 1 articulation point (cutpoints).

This page as a plain text file.
%I A241767 #25 Feb 16 2025 08:33:22
%S A241767 0,0,1,2,7,33,244,2792,52448,1690206,96288815,9873721048,
%T A241767 1841360945834,629414405238720,397024508142598996,
%U A241767 464923623652122023478,1016016289424631486429082,4162473006943138723685574978,32096861904411547975392065322659
%N A241767 Number of simple connected graphs with n nodes and exactly 1 articulation point (cutpoints).
%C A241767 Terms may be computed from A004115. See formula. There is an obvious bijection between a connected graph with 1 articulation point and a multiset of at least two rooted nonseparable graphs joined at the root node. - _Andrew Howroyd_, Nov 24 2020
%H A241767 Andrew Howroyd, <a href="/A241767/b241767.txt">Table of n, a(n) for n = 1..26</a>
%H A241767 Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a>
%H A241767 T. Hoppe and A. 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 A241767 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/ArticulationVertex.html">Articulation Vertex</a>
%F A241767 G.f.: x/(Product_{k>=1} (1 - x^k)^A004115(k+1)) - x - Sum_{k>=1} A004115(k)*x^k. - _Andrew Howroyd_, Nov 24 2020
%Y A241767 Column k=1 of A325111.
%Y A241767 Cf. other simple connected graph sequences with k articulation points A002218, A241767, A241768, A241769, A241770, A241771.
%Y A241767 Cf. A004115 (rooted and without articulation points).
%K A241767 nonn
%O A241767 1,4
%A A241767 _Travis Hoppe_ and _Anna Petrone_, Apr 28 2014
%E A241767 Terms a(11) and beyond from _Andrew Howroyd_, Nov 24 2020