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 A078564 #27 Jul 04 2025 22:23:33 %S A078564 1,1,2,6,20,93,515,3701,32714,359289,4847830,80064871,1607606989, %T A078564 38983675574 %N A078564 Number of (simple, undirected, unlabeled, connected) graphs with n vertices which contain no induced subgraph isomorphic to the complement of P5 (the "house" graph). %C A078564 Also, number of (simple, undirected, unlabeled, connected) graphs with n vertices which contain no induced subgraph isomorphic to a P5 (the path on 5 vertices). - _Falk Hüffner_, Nov 27 2015 %H A078564 Maria Chudnovsky, Jan Goedgebeur, Oliver Schaudt, Mingxian Zhong, <a href="http://arxiv.org/abs/1504.06979">Obstructions for three-coloring graphs without induced paths on six vertices</a>, arXiv preprint arXiv:1504.06979 [math.CO], 2015. %H A078564 F. Hüffner, <a href="https://github.com/falk-hueffner/tinygraph">tinygraph</a>, software for generating integer sequences based on graph properties, version 8489dde. %K A078564 more,nonn %O A078564 1,3 %A A078564 _Jim Nastos_, Jan 07 2003 %E A078564 Corrected by _Jim Nastos_, Jan 20 2003 %E A078564 a(10)-a(14) from _Falk Hüffner_, Jan 13 2016