|
|
A182008
|
|
a(n) = ceiling(sqrt(2*n*log(2))).
|
|
5
|
|
|
2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 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, 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, 11, 11, 11
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
This sequence approximates the sequence of solutions to the Birthday Problem, A033810. The two sequences agree on a set of integers n with density (3+2 log 2)/6 = 0.731...
|
|
LINKS
|
|
|
MATHEMATICA
|
|
|
PROG
|
(Magma) [Ceiling(Sqrt(2*n*Log(2))): n in [1..100]]; // Vincenzo Librandi, Aug 23 2015
(PARI) a(n) = { ceil(sqrt(2*n*log(2))) };
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|