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

A363884
Number of connected bipartite graphs on 2n nodes with a distinguished partite set of size n and with a unimodular reduced adjacency matrix.
0
1, 1, 5, 41, 777, 38749, 5552904, 2358289931
OFFSET
1,3
CROSSREFS
Inverse Euler transform of A363862.
Sequence in context: A076094 A076131 A003719 * A181033 A189997 A342439
KEYWORD
nonn,more,hard
AUTHOR
Max Alekseyev, Jun 25 2023
STATUS
approved