The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A221176 a(n) = Sum_{i=0..n} Stirling2(n,i)*2^(4i). 7

%I

%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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 28 20:27 EST 2020. Contains 338755 sequences. (Running on oeis4.)