id:A088141 - OEIS Search Results

Search: id:A088141

Displaying 1-1 of 1 results found.

page 1

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).

+0
4

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; listen)

	OFFSET	`2,2`
	COMMENT	`Related to the birthday paradox. This is essentially the same as A033810.`
	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.`
	CROSSREFS	`Cf. A033810, A072829.` `Sequence in context: A089051 A108229 A023966 this_sequence A083291 A003056 A117707` `Adjacent sequences: A088138 A088139 A088140 this_sequence A088142 A088143 A088144`
	KEYWORD	`nonn`
	AUTHOR	`Artemario Tadeu Medeiros da Silva (artemario(AT)uol.com.br), Nov 06 2003`
	EXTENSIONS	`Edited by Don Reble (djr(AT)nk.ca), Nov 07 2005`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research