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 A267602 #10 Jan 20 2016 04:19:21 %S A267602 0,0,0,1,1,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2, %T A267602 0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2, %U A267602 0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0,2,0 %N A267602 Number of unlabeled, connected graphs on n vertices that are prime and have no induced subgraph isomorphic to a bull, a P5 or a P5-bar. %C A267602 a(4) = 1 is the P_4, a(5) = 1 is the C_5, and a(n) = 2 for even n >= 6 are the unique prime bipartite chain graph on n vertices and its complement. - _Falk Hüffner_, Jan 18 2016 %H A267602 J. L. Fouquet, <a href="http://dx.doi.org/10.1016/0012-365X(93)90539-6">A Decomposition for a class of (P5,P5-bar)-free graphs</a>, Discrete Math. 121 (1993) 75-83. %Y A267602 Cf. A079577 (without "prime" requirement) %K A267602 nonn,easy %O A267602 1,6 %A A267602 _Falk Hüffner_, Jan 18 2016