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.

A243319 Number of simple connected graphs with n nodes that are bipartite and distance regular.

This page as a plain text file.
%I A243319 #9 Sep 14 2014 23:38:29
%S A243319 1,1,0,1,0,2,0,3,0,3
%N A243319 Number of simple connected graphs with n nodes that are bipartite and distance regular.
%H A243319 Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a>
%H A243319 T. Hoppe and A. Petrone, <a href="http://arxiv.org/abs/1408.3644">Integer sequence discovery from small graphs</a>, arXiv preprint arXiv:1408.3644, 2014
%Y A243319 Cf. A003216 (bipartite graphs), A241814 (distance regular graphs).
%K A243319 nonn,more
%O A243319 1,6
%A A243319 _Travis Hoppe_ and _Anna Petrone_, Jun 03 2014