%I #19 Jul 27 2021 11:29:34
%S 1,10,110,1310,16710,226510,3243110,48807310,768988710,12641850510,
%T 216229931110,3838516103310,70569453740710,1341065189434510,
%U 26298323383739110,531365183231239310,11047184452086972710,236029124143560378510,5176602413033115467110
%N E.g.f.: exp(10*(exp(x)-1)).
%C Number of ways of placing n labeled balls into n unlabeled (but 10-colored) boxes.
%H Alois P. Heinz, <a href="/A276507/b276507.txt">Table of n, a(n) for n = 0..510</a>
%F G.f.: A(x) satisfies 10*(x/(1-x))*A(x/(1-x)) = A(x)-1; ten times the binomial transform equals this sequence shifted one place left.
%p a:= proc(n) option remember; `if`(n=0, 1,
%p (1+add(binomial(n-1, k-1)*a(n-k), k=1..n-1))*10)
%p end:
%p seq(a(n), n=0..25); # _Alois P. Heinz_, Sep 25 2017
%t Table[BellB[n, 10], {n, 0, 30}]
%o (PARI) my(x='x+O('x^99)); Vec(serlaplace(exp(10*(exp(x)-1)))) \\ _Altug Alkan_, Sep 19 2016
%Y Cf. similar sequences listed in A276506.
%K nonn
%O 0,2
%A _Vincenzo Librandi_, Sep 19 2016