Triangle of expected coupon collection numbers rounded up; i.e., if aiming to collect part of a set of n coupons, the expected number of random coupons required to receive first the set with exactly k missing.
A071417
Triangle of expected coupon collection numbers rounded up; i.e., if aiming to collect part of a set of n coupons, the expected number of random coupons required to receive first the set with exactly k missing.
Terms
- a(0) =0a(1) =1a(2) =0a(3) =3a(4) =1a(5) =0a(6) =6a(7) =3a(8) =1a(9) =0a(10) =9a(11) =5a(12) =3a(13) =1a(14) =0a(15) =12a(16) =7a(17) =4a(18) =3a(19) =1a(20) =0a(21) =15a(22) =9a(23) =6a(24) =4a(25) =3a(26) =1a(27) =0a(28) =19a(29) =12
External references
- oeis: A071417