The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A133686

(Bold, blue-underlined text is an ; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

Number of labeled n-node graphs with at most one cycle in each connected component.
(history; published version)

#44 by OEIS Server at Sat Dec 30 17:12:10 EST 2023

LINKS

Alois P. Heinz, <a href="/A133686/b133686_1.txt">Table of n, a(n) for n = 0..386</a>

#43 by Alois P. Heinz at Sat Dec 30 17:12:10 EST 2023

STATUS

editing

Discussion

Sat Dec 30

17:12

OEIS Server: Installed new b-file as b133686.txt.  Old b-file is now b133686_1.txt.

#42 by Alois P. Heinz at Sat Dec 30 17:12:07 EST 2023

LINKS

Alois P. Heinz, <a href="/A133686/b133686.txt">Table of n, a(n) for n = 0..140</a>

STATUS

approved

#41 by Alois P. Heinz at Sat Dec 30 17:08:13 EST 2023

STATUS

proposed

#40 by Andrew Howroyd at Sat Dec 30 14:46:30 EST 2023

STATUS

editing

#39 by Andrew Howroyd at Sat Dec 30 14:45:21 EST 2023

FORMULA

STATUS

approved

#38 by Michael De Vlieger at Sat Dec 23 00:00:05 EST 2023

STATUS

proposed

#37 by Gus Wiseman at Fri Dec 22 19:53:50 EST 2023

STATUS

editing

#36 by Gus Wiseman at Fri Dec 22 10:46:54 EST 2023

CROSSREFS

A001187 counts connected graphs, A001349 unlabeled.

A058891 counts set-systems, unlabeled A000612, without singletons A016031.

A059201 counts covering T_0 set-systems, unlabeled A319637, ranks A326947.

A143543 counts simple labeled graphs by number of connected components.

#35 by Gus Wiseman at Fri Dec 22 06:00:06 EST 2023

COMMENTS

MATHEMATICA

CROSSREFS

STATUS

approved