Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A058844
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A058844
%S A058844 105,1260,9450,56980,302995,1487200,6914908,30950920,134779645,
%T A058844 575156036,2417578670,10046531276,41388056231,169371383384,
%U A058844 689568172832,2796362035104,11305163394129,45595968007260
%N A058844 Number of ways of placing n labeled balls into 4 indistinguishable boxes 
               with at least 2 balls in each box.
%H A058844 T. D. Noe, <a href="b058844.txt">Table of n, a(n) for n=8..200</a>
%F A058844 E.g.f.: ((exp(x) - 1 - x)^4)/4!. G.f.: x^8*(288*x^6 - 1560*x^5 + 3500*x^4 
               - 4130*x^3 + 2625*x^2 - 840*x + 105)/ ((1 - x)^4*(1 - 2*x)^3*(1 - 
               3*x)^2*(1 - 4*x))
%F A058844 a(n) = [4^n-3^(n-1)(4n+12)+2^(n-1)(12+9n+3n^2)-4n^3-8n-4]/24. - David 
               Wasserman (dwasserm(AT)earthlink.net), Jun 06 2007
%e A058844 a(8)=8!/(2!*2!*2!*2!*4!)=105
%Y A058844 Cf. A000247 (2 boxes), A000478 (3 boxes).
%Y A058844 Sequence in context: A166816 A166798 A033593 this_sequence A165382 A051015 
               A076377
%Y A058844 Adjacent sequences: A058841 A058842 A058843 this_sequence A058845 A058846 
               A058847
%K A058844 easy,nonn
%O A058844 8,1
%A A058844 Michael Steyer (msteyer(AT)osram.de), Dec 02 2000
%E A058844 More terms from James A. Sellers (sellersj(AT)math.psu.edu), Dec 06 2000

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research