A289470 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A289470

Number of strictly 2-connected graphs with n edges.

1, 0, 1, 1, 2, 3, 7, 15, 39, 107, 324, 1072, 3778, 14228, 56568, 235449, 1021381, 4596328, 21383982, 102594132, 506544749, 2569520447, 13372902590, 71322154244, 389402949706

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,5

LINKS

Table of n, a(n) for n=1..25.

FORMULA

a(n) = A010355(n) - A338511(n). - Andrew Howroyd, May 03 2021

CROSSREFS

Cf. A002218, A002840, A010355, A289471, A338511.

Sequence in context: A039826 A221547 A289471 * A368564 A213385 A161746

Adjacent sequences: A289467 A289468 A289469 * A289471 A289472 A289473

KEYWORD

nonn,more

AUTHOR

Ed Pegg Jr, Jul 06 2017

EXTENSIONS

a(12)-a(13) corrected and a(14)-a(25) from Andrew Howroyd, May 03 2021

STATUS

approved