login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A336545 Sum over all unlabeled connected graphs of order n, of the number of connected graphs obtainable by deletion of a single vertex in the graph. 2
1, 1, 2, 8, 44, 333, 3771, 67099, 2026711, 108874798, 10682063400 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

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

Sean A. Irvine, Illustration of initial terms

Sean A. Irvine, Java program (github)

CROSSREFS

Cf. A336544.

Sequence in context: A190818 A330444 A253949 * A126101 A308478 A157994

Adjacent sequences:  A336542 A336543 A336544 * A336546 A336547 A336548

KEYWORD

nonn,more

AUTHOR

Sean A. Irvine, Jul 25 2020

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 22 10:29 EDT 2021. Contains 348160 sequences. (Running on oeis4.)