[seqfan] Re: A019575 challenge

[Ron Hardin]

Curiously the number of NON-distinguishable balls problem seems not to be in 
OEIS
(either that or I have a bug in computing it)

so far, triangle tabl

1,1,2,1,6,3,1,18,12,4,1,50,50,20,5,1,140,195,90,30,6,1,392,735,392,147,
42,7,1,1106,2716,1652,672,224,56,8,1,3138,9912,6804,2970,1080,324,72,9,
1,8952,35850,27600,12825,4950,1650,450,90,10,1,25652,128865,110715
T(n,k)=Number of arrangements of n indistinguishable balls in n boxes with the 
maximum number of balls in any box equal to k
Table starts
1
1 2
1 6 3
1 18 12 4
1 50 50 20 5
1 140 195 90 30 6
Table of n, a(n) for n=1..423

current and irregularly updated b-file at 
http://rhhardin.home.mindspring.com/current4.txt


 rhhardin at mindspring.com
rhhardin at att.net (either)