login
a(n) = Sum_{i=0..n} Stirling2(n,i)*2^(4i).
7

%I #11 Aug 29 2020 07:15:05

%S 1,16,272,4880,91920,1810192,37142288,791744272,17490370320,

%T 399558315792,9421351690000,228916588400400,5723078052339472,

%U 147025755978698512,3876566243300318992,104789417805394595600,2901159958960121863952,82188946843192555474704,2380551266738846355103504,70441182699006212824911632

%N a(n) = Sum_{i=0..n} Stirling2(n,i)*2^(4i).

%C The number of ways of putting n labeled balls into a set of bags and then putting the bags into 16 labeled boxes. - _Peter Bala_, Mar 23 2013

%H Frank Simon, <a href="https://nbn-resolving.org/urn:nbn:de:bsz:14-qucosa-101154">Algebraic Methods for Computing the Reliability of Networks</a>, Dissertation, Doctor Rerum Naturalium (Dr. rer. nat.), Fakultät Mathematik und Naturwissenschaften der Technischen Universität Dresden, 2012. See Table 5.1.

%F E.g.f. exp(16*(exp(x) - 1)). - _Peter Bala_, Mar 23 2013

%Y Cf. A000110, A001861, A078944, A221159. A027710, A144180, A144223, A144263, A189233.

%K nonn

%O 0,2

%A _N. J. A. Sloane_, Jan 04 2013