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.

A125064 Number of simple graphs on at most 16 unlabeled vertices with maximal degree at most 4 with a single cycle of length 16-n.

This page as a plain text file.
%I A125064 #7 Feb 03 2025 02:10:40
%S A125064 1,2,11,39,169,534,1612,3894,8771,16307,29391,43291,69429,83571
%N A125064 Number of simple graphs on at most 16 unlabeled vertices with maximal degree at most 4 with a single cycle of length 16-n.
%C A125064 In the terms of the paper by Hendrickson and Parks, a(n) is the number of monocyclic skeletons with up to 16 nodes with a ring of size 16-n.
%H A125064 James B. Hendrickson and Camden A. Parks, <a href="https://doi.org/10.1021/ci00001a018">Generation and Enumeration of Carbon Skeletons</a>, J. Chem. Inf. Comput. Sci., 31 (1991), pp. 101-107. See Table VI on page 103.
%F A125064 Sum_n a(n) = Sum_{k=3..16} A036671(k).
%Y A125064 Cf. A000602, A036671, A112410, A112619, A112408, A112424, A112425, A112426.
%K A125064 nonn,fini,full
%O A125064 0,2
%A A125064 _Parthasarathy Nambi_, Jan 05 2007
%E A125064 Edited by _Andrey Zabolotskiy_, Feb 02 2025