cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A382348 Number of connected bipartite graphs with n edges.

This page as a plain text file.
%I A382348 #67 Jun 09 2025 01:01:37
%S A382348 1,1,2,4,7,17,36,94,237,658,1845,5527,16809,53357,173298,580331,
%T A382348 1988935,6991328,25124511,92325353,346401296,1326493369
%N A382348 Number of connected bipartite graphs with n edges.
%H A382348 Brendan McKay and Adolfo Piperno, <a href="https://pallini.di.uniroma1.it">nauty and Traces</a>.
%e A382348 a(3) = 2 since there are two connected bipartite graphs with three edges: a path and a star "Y".
%o A382348 (nauty) for (( i=$(bc <<< "sqrt(4*${n})"); i<=$((n+1)); i++ )) do ~/nauty2_8_9/geng -c -b ${i}:${i} ${n} -u; done
%Y A382348 Cf. A002905, A005142.
%K A382348 nonn,nice,more
%O A382348 1,3
%A A382348 _Sergey Pupyrev_, May 29 2025
%E A382348 a(19)-a(22) from _Sean A. Irvine_, Jun 09 2025