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 A120333 #11 Jul 03 2018 02:33:28
%S A120333 1,1,4,9,28,71,198,521,1418,3773,10153,27114,72705,194531,521447,
%T A120333 1397482,3749836,10067417,27057233,72779710,195963184,528127752,
%U A120333 1424707167,3846943003,10397057771,28125235102,76149287981,206351312858,559642013499,1519019192097
%N A120333 Number of monocyclic skeletons with n carbon atoms and a ring size of 5.
%D A120333 Camden A. Parks and James B. Hendrickson, Enumeration of monocyclic and bicyclic carbon skeletons, J. Chem. Inf. Comput. Sci., vol. 31, 334-339 (1991).
%H A120333 Andrew Howroyd, <a href="/A120333/b120333.txt">Table of n, a(n) for n = 5..200</a>
%e A120333 If n=10 then the number of monocyclic skeletons with ring size of five is 71.
%t A120333 G[n_] := Module[{g}, Do[g[x_] = 1 + x*(g[x]^3/6 + g[x^2]*g[x]/2 + g[x^3]/3) + O[x]^n // Normal, {n}]; g[x]];
%t A120333 T[n_, k_] := Module[{t = G[n], g}, t = x*((t^2 + (t /. x -> x^2))/2); g[e_] = (Normal[t + O[x]^Quotient[n, e]] /. x -> x^e) + O[x]^n // Normal; Coefficient[(Sum[EulerPhi[d]*g[d]^(k/d), {d, Divisors[k]}]/k + If[OddQ[ k], g[1]*g[2]^Quotient[k, 2], (g[1]^2 + g[2])*g[2]^(k/2-1)/2])/2, x, n]];
%t A120333 a[n_] := T[n + 5, 5];
%t A120333 Table[a[n], {n, 0, 30}] (* _Jean-François Alcover_, Jul 03 2018, after _Andrew Howroyd_ *)
%Y A120333 Column k=5 of A305059.
%K A120333 nonn
%O A120333 5,3
%A A120333 _Parthasarathy Nambi_, Aug 13 2006
%E A120333 More terms from _N. J. A. Sloane_, Aug 27 2006
%E A120333 Terms a(26) and beyond from _Andrew Howroyd_, May 24 2018