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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A088141 a(n) = the largest k such that, if k samples are taken from a group of n items, with replacement, a duplication is unlikely (p<1/2). 7
1, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,2

COMMENTS

Related to the birthday paradox. This is essentially the same as A033810.

LINKS

Arkadiusz Wesolowski, Table of n, a(n) for n = 2..10000

EXAMPLE

a(365)=22 because if 22 people are sampled, it is unlikely that two have the same birthday; but if 23 are sampled, it is likely.

MATHEMATICA

lst = {}; s = 1; Do[Do[If[Product[(n - i)/n, {i, j}] <= 1/2, If[j > s, s = j]; AppendTo[lst, j]; Break[]], {j, s, s + 1}], {n, 2, 86}]; lst (* Arkadiusz Wesolowski, Apr 29 2012 *)

CROSSREFS

Cf. A033810, A072829.

Sequence in context: A317359 A108229 A023966 * A185283 A214972 A225687

Adjacent sequences:  A088138 A088139 A088140 * A088142 A088143 A088144

KEYWORD

nonn

AUTHOR

Artemario Tadeu Medeiros da Silva (artemario(AT)uol.com.br), Nov 06 2003

EXTENSIONS

Edited by Don Reble, Nov 07 2005

STATUS

approved

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 7 07:54 EDT 2020. Contains 336274 sequences. (Running on oeis4.)