The On-Line Encyclopedia of Integer Sequences® (OEIS®)

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

Revision History for A327079 (Underlined text is an addition; strikethrough text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A327079

Number of labeled simple connected graphs covering n vertices with at least one bridge that is not an endpoint/leaf (non-spanning edge-connectivity 1).
(history; published version)

#13 by Susanna Cuyler at Wed Sep 11 20:21:40 EDT 2019

STATUS

proposed

approved

#12 by Gus Wiseman at Wed Sep 11 17:22:04 EDT 2019

STATUS

editing

proposed

#11 by Gus Wiseman at Wed Sep 11 16:51:43 EDT 2019

FORMULA

Inverse binomial transform of A327231.

CROSSREFS

The non-covering version is A327231.

STATUS

approved

editing

#10 by Alois P. Heinz at Wed Aug 28 10:26:26 EDT 2019

STATUS

reviewed

approved

#9 by Michel Marcus at Wed Aug 28 10:18:37 EDT 2019

STATUS

proposed

reviewed

#8 by Andrew Howroyd at Wed Aug 28 10:17:07 EDT 2019

STATUS

editing

proposed

#7 by Andrew Howroyd at Tue Aug 27 17:40:08 EDT 2019

	DATA	`0, 0, 1, 0, 12, 180, 4200, 157920, 9673664, 1011129840, 190600639200, 67674822473280, 46325637863907072, 61746583700640860736, 161051184122415878112640, 824849999242893693424992000, 8317799170120961768715123118080`
	FORMULA	`a(n) = A001187(n) - A322395(n) for n > 2. - Andrew Howroyd, Aug 27 2019`
	KEYWORD	`nonn,more,new`
	EXTENSIONS	`Terms a(6) and beyond from Andrew Howroyd, Aug 27 2019`
	STATUS	`approved` `editing`

#6 by N. J. A. Sloane at Mon Aug 26 12:39:57 EDT 2019

STATUS

proposed

approved

#5 by Gus Wiseman at Mon Aug 26 12:27:33 EDT 2019

STATUS

editing

proposed

#4 by Gus Wiseman at Mon Aug 26 12:27:22 EDT 2019

NAME

Number of labeled simple connected graphs covering n vertices with at least one bridge that is not an endpoint/leaf. (non-spanning edge-connectivity 1).

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 29 11:28 EDT 2024. Contains 375516 sequences. (Running on oeis4.)