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.

A243327 Number of simple connected graphs with n nodes that are K_4 free and not integral.

This page as a plain text file.
%I A243327 #13 Nov 27 2015 00:01:56
%S A243327 0,0,1,4,15,77,531,5597,95900,2784034
%N A243327 Number of simple connected graphs with n nodes that are K_4 free and not integral.
%C A243327 K_4 is the complete graph on four vertices.
%H A243327 Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a>
%H A243327 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 [math.CO], 2014.
%Y A243327 Cf. A241842 (non-integral graphs), A079574 (K_4-free graphs).
%K A243327 nonn,more
%O A243327 1,4
%A A243327 _Travis Hoppe_ and _Anna Petrone_, Jun 03 2014