59874
domain: N
Appears in sequences
- a(n) = floor(e^n).at n=11A000149
- Nearest integer to e^n.at n=11A000227
- Numbers k >= 2 such that if 1 <= j < k then fractional part of log k > fractional part of log j.at n=11A004791
- a(n) = floor(e^((n-1)/2)).at n=23A005182
- Floor of exp(n-th prime).at n=4A051102
- Sequence of the radicands that give the best radical approach to e.at n=14A079663
- log(n) is closer to an integer than is log(m) for any m with 2<=m<n.at n=11A080021
- Numbers k with all digits distinct and nonzero, such that none of k's digits divide k, but all the nonzero digits not in k do divide k.at n=13A133598
- a(n) = floor(e^(n/3)).at n=32A214077
- a(n) is the smallest integer k>1 such that |log(k)-round(log(k))| is smaller than 10^(-n).at n=4A345328