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.

A289470 Number of strictly 2-connected graphs with n edges.

This page as a plain text file.
%I A289470 #11 May 03 2021 20:12:14
%S A289470 1,0,1,1,2,3,7,15,39,107,324,1072,3778,14228,56568,235449,1021381,
%T A289470 4596328,21383982,102594132,506544749,2569520447,13372902590,
%U A289470 71322154244,389402949706
%N A289470 Number of strictly 2-connected graphs with n edges.
%F A289470 a(n) = A010355(n) - A338511(n). - _Andrew Howroyd_, May 03 2021
%Y A289470 Cf. A002218, A002840, A010355, A289471, A338511.
%K A289470 nonn,more
%O A289470 1,5
%A A289470 _Ed Pegg Jr_, Jul 06 2017
%E A289470 a(12)-a(13) corrected and a(14)-a(25) from _Andrew Howroyd_, May 03 2021