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 A136793 #15 Dec 13 2018 11:33:33
%S A136793 4,16,104,752,5996,50512,444256,4027360,37383044,353486320,3393093696,
%T A136793 32976302800,323839605124,3208549483216,32033691247528,
%U A136793 321955764477936,3254812520854980,33075467402453872,337670437247448728,3461635652745799136,35620112071990294784
%N A136793 Number of unlabeled rooted trees with n 4-colored nodes.
%D A136793 F. Bergeron, G. Labelle and P. Leroux, Combinatorial Species and Tree-Like Structures, Cambridge, 1998, p. 293 (4.1.60).
%H A136793 L. Foissy, <a href="https://arxiv.org/abs/1811.07572">Algebraic structures on typed decorated rooted trees</a>, arXiv:1811.07572 (2018)
%H A136793 N. J. A. Sloane, <a href="/transforms.txt">Transforms</a>
%H A136793 <a href="/index/Ro#rooted">Index entries for sequences related to rooted trees</a>
%F A136793 Shifts left and divides by 4 under EULER transform. a(n) = A136794(n)*2 = A052763(n)*4.
%p A136793 with(numtheory):
%p A136793 a:= proc(n) option remember; `if`(n<2, n*4, (add(add(d*
%p A136793 a(d), d=divisors(j))*a(n-j), j=1..n-1))/(n-1))
%p A136793 end:
%p A136793 seq(a(n), n=1..25); # _Alois P. Heinz_, May 16 2014
%t A136793 a[1] = 4; a[n_] := a[n] = Sum[ Sum[ d*a[d], {d, Divisors[j]}]*a[n-j], {j, 1, n-1}]/(n-1); Table[a[n], {n, 1, 25}] (* _Jean-François Alcover_, Feb 24 2015, after _Alois P. Heinz_ *)
%K A136793 nonn
%O A136793 1,1
%A A136793 _Christian G. Bower_, Jan 21 2008