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 A038059 #29 Aug 03 2020 05:52:00
%S A038059 3,9,45,246,1485,9432,62625,428319,3000393,21410436,155106693,
%T A038059 1137703869,8432624850,63060142671,475196487363,3604851603690,
%U A038059 27507181503069,210988219961637,1625848092941463,12580709718788622,97714211996345868,761528782558088202
%N A038059 Number of rooted trees with 3-colored nodes.
%C A038059 Shifts left and divides by 3 under Euler transform.
%H A038059 L. Foissy, <a href="https://arxiv.org/abs/1811.07572">Algebraic structures on typed decorated rooted trees</a>, arXiv:1811.07572 [math.RA] (2018).
%H A038059 R. J. Mathar, <a href="http://arxiv.org/abs/1603.00077">Topologically distinct sets of non-intersecting circles in the plane</a>, arXiv:1603.00077 [math.CO] (2016), Table 4.
%H A038059 N. J. A. Sloane, <a href="/transforms.txt">Transforms</a>
%H A038059 <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a>
%H A038059 <a href="/index/Tra#trees">Index entries for sequences related to trees</a>
%F A038059 a(n) = 3 * A006964(n).
%p A038059 with(numtheory): a:= proc(n) option remember; `if`(n<2, 3*n, (add(add(d*a(d), d=divisors(j)) *a(n-j), j=1..n-1))/ (n-1)) end: seq(a(n), n=1..30); # _Alois P. Heinz_, Sep 06 2008
%t A038059 a[n_] := a[n] = If[n<2, 3*n, Sum[Sum[d*a[d], {d, Divisors[j]}] *a[n-j], {j, 1, n-1}]/(n-1)]; Array[a, 30] (* _Jean-François Alcover_, Feb 24 2016, after _Alois P. Heinz_ *)
%Y A038059 Cf. A000081, A038055-A038062, A271879 (multisets).
%K A038059 nonn,eigen
%O A038059 1,1
%A A038059 _Christian G. Bower_, Jan 04 1999