login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Number of (n-3)-connected unlabeled n-node graphs.
0

%I #7 Mar 17 2023 06:51:19

%S 4,6,10,17,25,39,59,87,127,186

%N Number of (n-3)-connected unlabeled n-node graphs.

%D M. Kirchweger, M. Scheucher, and S. Szeider, SAT-Based Generation of Planar Graphs, in preparation.

%F a(n) = Sum_{j=1..3} A259862(n, n-j). - _Andrew Howroyd_, Mar 16 2023

%Y Cf. A259862.

%K nonn,more

%O 3,1

%A _Manfred Scheucher_, Mar 15 2023