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.
%I A218090 #31 Apr 18 2021 20:41:16 %S A218090 1,1,1,1,2,3,8,17,63,224,1248,8218,75992,906635,14447433,303100595, %T A218090 8415834690,309390830222,15105805368214,982300491033887 %N A218090 Number of unlabeled point-determining bipartite graphs on n vertices. %C A218090 A graph is point-determining if no two vertices have the same set of neighbors. This kind of graph is also called a mating graph. %H A218090 Ira Gessel and Ji Li, <a href="http://arxiv.org/abs/0705.0042">Enumeration of point-determining graphs</a>, arXiv:0705.0042 [math.CO] %H A218090 Andy Hardt, Pete McNeely, Tung Phan, and Justin M. Troyka, <a href="http://arxiv.org/abs/1312.0542">Combinatorial species and graph enumeration</a>, arXiv:1312.0542 [math.CO]. %e A218090 Consider n = 3. The triangle graph is point-determining, but it is not bipartite, so it is not counted in a(3). The graph *--*--* is bipartite, but it is not point-determining (the vertices on the two ends have the same neighborhood), so it is also not counted in a(3). The only graph counted in a(3) is the graph *--* *. - _Justin M. Troyka_, Nov 27 2013 %Y A218090 Cf. A006024, A004110 (labeled and unlabeled point-determining graphs). %Y A218090 Cf. A092430, A004108 (labeled and unlabeled connected point-determining graphs). %Y A218090 Cf. A232699 (labeled point-determining bipartite graphs). %Y A218090 Cf. A232700, A088974 (labeled and unlabeled connected point-determining bipartite graphs). %K A218090 nonn,more %O A218090 0,5 %A A218090 _Andy Hardt_, Oct 20 2012