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.

A243561 Number of simple connected graphs with n nodes that are distance regular and have no subgraph isomorphic to diamond graph.

This page as a plain text file.
%I A243561 #12 Jun 27 2014 15:03:12
%S A243561 1,1,1,1,1,2,1,3,2,4
%N A243561 Number of simple connected graphs with n nodes that are distance regular and have no subgraph isomorphic to diamond graph.
%H A243561 Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a>
%Y A243561 Cf. A242790 (diamond free graphs), A241814 (distance regular graphs).
%K A243561 nonn,more
%O A243561 1,6
%A A243561 _Travis Hoppe_ and _Anna Petrone_, Jun 06 2014