8886110
domain: N
Appears in sequences
- a(n) = floor(e^n).at n=16A000149
- Numbers k >= 2 such that if 1 <= j < k then fractional part of log k > fractional part of log j.at n=15A004791
- a(n) = floor(e^((n-1)/2)).at n=33A005182
- Sequence of the radicands that give the best radical approach to e.at n=19A079663
- log(n) is closer to an integer than is log(m) for any m with 2<=m<n.at n=16A080021
- a(n) = floor(exp(2*n)).at n=8A116472
- a(n) = floor(exp(n^2)).at n=3A117681
- a(n) is the smallest integer k>1 such that |log(k)-round(log(k))| is smaller than 10^(-n).at n=6A345328