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.

A243246 Number of unlabeled, connected graphs on n vertices with at least one subgraph isomorphic to a C_5, where C_5 is the cycle graph on five vertices.

This page as a plain text file.
%I A243246 #24 Feb 16 2025 08:33:22
%S A243246 0,0,0,0,8,68,709,10540,258623,11704072,1006628171,164059321534,
%T A243246 50335903460830,29003487412989468
%N A243246 Number of unlabeled, connected graphs on n vertices with at least one subgraph isomorphic to a C_5, where C_5 is the cycle graph on five vertices.
%H A243246 Travis Hoppe and Anna Petrone, <a href="https://github.com/thoppe/Encyclopedia-of-Finite-Graphs">Encyclopedia of Finite Graphs</a>
%H A243246 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.
%H A243246 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/CycleGraph.html">Cycle Graph</a>
%F A243246 a(n) = A001349(n) - A241784(n).
%Y A243246 Cf. A001349, A241784.
%K A243246 nonn,more
%O A243246 1,5
%A A243246 _Travis Hoppe_ and _Anna Petrone_, Jun 01 2014
%E A243246 a(11)-a(14) from formula by _Falk Hüffner_, Sep 22 2020