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 A032203 #15 Jun 21 2018 10:34:34
%S A032203 1,1,2,5,12,36,104,331,1062,3519,11809,40327,139066,484698,1702819,
%T A032203 6026452,21460248,76846950,276524978,999423375,3626370269,13205135288,
%U A032203 48241233346,176757275833,649399348322,2391817886703
%N A032203 Number of series-reduced planted compound windmills with n leaves.
%H A032203 Andrew Howroyd, <a href="/A032203/b032203.txt">Table of n, a(n) for n = 1..200</a>
%H A032203 <a href="/index/Mo#mobiles">Index entries for sequences related to mobiles</a>
%H A032203 INRIA Algorithms Project, <a href="http://ecs.inria.fr/services/structure?nbr=79">Encyclopedia of Combinatorial Structures 79</a>
%F A032203 Doubles (index 2+) under "CIK" (necklace, indistinct, unlabeled) transform.
%o A032203 (PARI)
%o A032203 CIK(p,n)={sum(d=1, n, eulerphi(d)/d*log(subst(1/(1+O(x*x^(n\d))-p), x, x^d)))}
%o A032203 seq(n)={my(p=x); for(i=2, n, p+=x^i*polcoeff(CIK(p,i),i)); Vecrev(p/x)} \\ _Andrew Howroyd_, Jun 21 2018
%K A032203 nonn
%O A032203 1,3
%A A032203 _Christian G. Bower_