A363884 - 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

A363884

Number of connected bipartite graphs on 2n nodes with a distinguished partite set of size n and with a unimodular reduced adjacency matrix.

%I #12 Jul 04 2023 09:51:18

%S 1,1,5,41,777,38749,5552904,2358289931

%N Number of connected bipartite graphs on 2n nodes with a distinguished partite set of size n and with a unimodular reduced adjacency matrix.

%Y Inverse Euler transform of A363862.

%Y Cf. A306837, A363846.

%K nonn,more,hard

%O 1,3

%A _Max Alekseyev_, Jun 25 2023