|
| |
|
|
A111097
|
|
Maximum likelihood of the number of distinguishable marbles in an urn if repeated random sampling of one marble with replacement yields n different marbles before the first repeated marble.
|
|
2
|
|
|
|
1, 2, 5, 8, 13, 19, 25, 33, 42, 51, 62, 74, 86, 100, 115, 130, 147, 165, 183, 203, 224, 245, 268, 292, 316, 342, 369, 396, 425, 455, 485, 517, 550, 583, 618, 654, 690, 728, 767, 806, 847, 889, 931, 975, 1020, 1065, 1112, 1160, 1208, 1258, 1309, 1360, 1413
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,2
|
|
|
COMMENTS
|
The numbers in my sequence match the first 8 nonzero numbers in sequence A083704 and the first 40 terms (at least) remain very close to those in A083704. The program below is very crude and will yield the first 20 terms. To get further terms, one must increase the maximum value of n and then increase the maximum value of k so that the maximum value of k is larger than a(n) for the maximum value of n.
a(n) is the most likely number of distinct marbles in an urn when drawing n unique marbles consecutively (with replacement) before the first repeated marble.
Conjecture: Second order difference is {2, 0, 2, 1, 0, 2, 1, 0, 2, ..., 1, 0, 2}. (End)
|
|
|
LINKS
|
|
|
|
EXAMPLE
|
a(3)=5 because of all urns containing marbles numbered 1, 2, 3, ..., k, an urn containing k = 5 marbles has the largest probability of yielding 3 different marbles before a first repeated marble when sampling with replacement.
|
|
|
MATHEMATICA
|
p[0] = 1; p[n_] := p[n] = (k - n)/k*p[n - 1]; a[1] = 1; a[n_] := a[n] = Maximize[p[n - 1]*(n/k), k, Integers][[2, 1, 2]]; Table[a[n], {n, 1, 53}] (* Robert P. P. McKone, Nov 16 2023 *)
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
Marc A. Brodie (mbrodie(AT)wju.edu), Oct 13 2005
|
|
|
EXTENSIONS
|
|
|
|
STATUS
|
approved
|
| |
|
|
