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.

A363846 Number of connected bipartite graphs on 2n nodes with a marked bipartite set of size n.

This page as a plain text file.
%I A363846 #12 Jun 25 2023 08:13:31
%S A363846 1,1,2,13,150,3529,194203,29350896,13668966399,20662731749804,
%T A363846 103588456044907944,1744955436868541083098,99859125842603176324368784,
%U A363846 19611138475504485904873456937288,13340730475029359536419515017040194246,31706419735128559894860278029259121951682970,265351742295121848168241791689670791068746978140331
%N A363846 Number of connected bipartite graphs on 2n nodes with a marked bipartite set of size n.
%C A363846 Also, number of n X n binary matrices up to permutations of rows and columns, representing the reduced adjacency matrices of connected bipartite graphs (cf. A002724).
%H A363846 Max Alekseyev, <a href="/A363846/b363846.txt">Table of n, a(n) for n = 0..50</a>
%F A363846 a(n) = A363845(2n, n).
%Y A363846 Diagonal of the rectangular array described in A363845.
%Y A363846 Cf. A002724, A028657, A123549.
%K A363846 nonn
%O A363846 0,3
%A A363846 _Max Alekseyev_, Jun 24 2023