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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A052442 Number of simple unlabeled n-node graphs of connectivity 1. 11
0, 1, 1, 3, 11, 56, 385, 3994, 67014, 1973029, 105731474, 10439496931, 1902968718515, 641662974453892, 401490336727861176, 467924684115578671326, 1019752390010650509117288, 4171131179469162937375841939, 32134378048921787829834095722663, 467778894124037894839737804918978194 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
Jean-François Alcover, Table of n, a(n) for n = 1..26
Eric Weisstein's World of Mathematics, k-Connected Graph.
Eric Weisstein's World of Mathematics, Biconnected Graph
FORMULA
a(n) = A001349(n) - A002218(n) for n > 2. - Andrew Howroyd, Sep 04 2019
MATHEMATICA
A001349 = Cases[Import["https://oeis.org/A001349/b001349.txt", "Table"], {_, _}][[All, 2]];
A002218 = Cases[Import["https://oeis.org/A002218/b002218.txt", "Table"], {_, _}][[All, 2]];
a[1] = 0; a[2] = 1;
a[n_] := A001349[[n+1]] - A002218[[n]];
Array[a, 26] (* Jean-François Alcover, Sep 10 2019, after Andrew Howroyd *)
CROSSREFS
Column k=1 of A259862.
Sequence in context: A000985 A207433 A094611 * A217034 A330351 A180112
KEYWORD
nonn
AUTHOR
EXTENSIONS
Terms a(8)-a(11) by Jens M. Schmidt, Feb 18 2019
a(1)-a(2) corrected by Andrew Howroyd, Aug 28 2019
a(12)-a(20) from Andrew Howroyd, Sep 04 2019
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 29 10:44 EDT 2024. Contains 371268 sequences. (Running on oeis4.)