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.

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

This page as a plain text file.
%I A363884 #12 Jul 04 2023 09:51:18
%S A363884 1,1,5,41,777,38749,5552904,2358289931
%N A363884 Number of connected bipartite graphs on 2n nodes with a distinguished partite set of size n and with a unimodular reduced adjacency matrix.
%Y A363884 Inverse Euler transform of A363862.
%Y A363884 Cf. A306837, A363846.
%K A363884 nonn,more,hard
%O A363884 1,3
%A A363884 _Max Alekseyev_, Jun 25 2023