Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #12 Apr 13 2019 22:19:45
%S 0,1,6,51,542,6273,77262,991264,13109394,177428496,2445799878,
%T 34218909015,484668543660,6935979521095,100136840127534,
%U 1456726481340477,21332234689262126,314211310198197978,4652073871301311128,69194159284034697860,1033441834436615884266
%N Number of rooted identity trees with n nodes and 6-colored non-root nodes.
%H Alois P. Heinz, <a href="/A255518/b255518.txt">Table of n, a(n) for n = 0..800</a>
%F a(n) ~ c * d^n / n^(3/2), where d = 16.1255293604485586705050971466317639696978222052989685416919877643317..., c = 0.065726585606326795496161701400246926800764944... . - _Vaclav Kotesovec_, Feb 24 2015
%F From _Ilya Gutkovskiy_, Apr 13 2019: (Start)
%F G.f. A(x) satisfies: A(x) = x*exp(6*Sum_{k>=1} (-1)^(k+1)*A(x^k)/k).
%F G.f.: A(x) = Sum_{n>=1} a(n)*x^n = x * Product_{n>=1} (1 + x^n)^(6*a(n)). (End)
%p with(numtheory):
%p a:= proc(n) option remember; `if`(n<2, n, -add(a(n-j)*add(
%p 6*a(d)*d*(-1)^(j/d), d=divisors(j)), j=1..n-1)/(n-1))
%p end:
%p seq(a(n), n=0..30);
%Y Column k=6 of A255517.
%K nonn
%O 0,3
%A _Alois P. Heinz_, Feb 24 2015