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 A185227 #20 Sep 08 2022 08:45:55
%S A185227 0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,2,2,3,3,4,5,6,7,9,10,12,14,17,19,23,
%T A185227 26,31,35,41,47,55,62,72,82,95,107,124,140,161,182,208,235,269,303,
%U A185227 345,389,442,497,564,634,718,806,910,1021,1152,1290,1452,1627,1828,2044,2294
%N A185227 Number of disconnected 2-regular simple graphs on n vertices with girth at least 7.
%C A185227 Number of partitions of n with each part at least 7, and at least 2 parts.
%H A185227 Andrew Howroyd, <a href="/A185227/b185227.txt">Table of n, a(n) for n = 0..1000</a>
%H A185227 Jason Kimberley, <a href="/wiki/User:Jason_Kimberley/D_k-reg_girth_ge_g_index">Index of sequences counting disconnected k-regular simple graphs with girth at least g</a>
%F A185227 a(n) = A185327() - A185117(n). - _Andrew Howroyd_, Apr 18 2021
%o A185227 (Magma) A185227 := func<n|n eq 0 select 0 else #RestrictedPartitions(n,{7..n-1})>;
%Y A185227 Disconnected 2-regular simple graphs with girth at least g: A165652 (g=3), A185224 (g=4), A185225 (g=5), A185226 (g=6), this sequence (g=7), A185228 (g=8), A185229 (g=9).
%Y A185227 Disconnected k-regular simple graphs with girth at least 7: A185217 (all k), A185207 (triangle); this sequence (k=2), A185237 (k=3).
%Y A185227 Cf. A185117, A185327.
%K A185227 nonn,easy
%O A185227 0,17
%A A185227 _Jason Kimberley_, Feb 22 2011