A292126 - OEIS

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

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”).

Other ways to Give

A292126

Number of two-terminal exclusive-bridged graphs with n edges.

%I #8 Sep 09 2017 11:59:33

%S 0,0,0,0,1,4,21,86,349,1328,4925,17786

%N Number of two-terminal exclusive-bridged graphs with n edges.

%C 1

%H Marx Stampfli, <a href="https://dx.doi.org/10.1016%2Fj.amc.2016.12.030">Bridged graphs, circuits and Fibonacci numbers</a>, Applied Mathematics and Computation, Volume 302, 1 June 2017, Pages 68-79.

%Y Cf. A000084, A048211, A174285, A174286.

%K nonn,more

%O 1,6

%A _Eric M. Schmidt_, Sep 09 2017