|
%I #7 Jul 27 2020 11:24:35
%S 1,1,2,8,44,333,3771,67099,2026711,108874798,10682063400
%N 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.
%H Sean A. Irvine, <a href="/A336544/a336544.pdf">Illustration of initial terms</a>
%H Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a336/A336545.java">Java program</a> (github)
%Y Cf. A336544.
%K nonn,more
%O 1,3
%A _Sean A. Irvine_, Jul 25 2020
|
