|
|
A182009
|
|
a(n) = ceiling(sqrt(2n*log(2))+(3-2*log(2))/6).
|
|
5
|
|
|
2, 2, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 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, 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
|
1,1
|
|
COMMENTS
|
This sequence approximates the sequence of solutions to the Birthday Problem, A033810. The two sequences agree for almost all n, i.e., on a set of integers n with density 1.
|
|
LINKS
|
|
|
MAPLE
|
seq(ceil((2*n*log(2))^(1/2) + (3-2*log(2))/6), n=1..1000); # Robert Israel, Aug 23 2015
|
|
MATHEMATICA
|
Table[Ceiling[Sqrt[2 n Log[2] + (3 - 2 Log[2])/6]], {n, 82}] (* Michael De Vlieger, Aug 24 2015 *)
|
|
PROG
|
(PARI)
a(n) = { ceil((2*n*log(2))^(1/2) + (3-2*log(2))/6) };
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|