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 A108532 #9 Jun 20 2018 16:36:58
%S A108532 1,2,4,12,38,136,490,1852,7108,27880,110892,447060,1821252,7489732,
%T A108532 31045350,129587996,544228664,2298008824,9750218012,41548438040,
%U A108532 177740526076,763046178960,3286318131646,14195239150556,61481540391722
%N A108532 Number of asymmetric mobiles (cycle rooted trees) with n nodes and 2-colored internal (non-leaf) nodes.
%H A108532 Andrew Howroyd, <a href="/A108532/b108532.txt">Table of n, a(n) for n = 1..200</a>
%H A108532 <a href="/index/Mo#mobiles">Index entries for sequences related to mobiles</a>
%H A108532 C. G. Bower, <a href="/transforms2.html">Transforms (2)</a>
%F A108532 Shifts left and halves under CHK transform.
%o A108532 (PARI)
%o A108532 CHK(p,n)={sum(d=1, n, moebius(d)/d*log(subst(1/(1+O(x*x^(n\d))-p), x, x^d)))}
%o A108532 seq(n)={my(p=O(1));for(i=1, n, p=1+2*CHK(x*p, i)); Vec(p)} \\ _Andrew Howroyd_, Jun 20 2018
%Y A108532 Cf. A032171, A108530, A108531.
%K A108532 nonn,eigen
%O A108532 1,2
%A A108532 _Christian G. Bower_, Jun 07 2005