A363832 Number of digits left of the radix point of n when written in base e using a greedy algorithm representation.
1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5
Offset: 0
Examples
a(10) = 3 because 10 in base e (102.11201...) has 3 digits before the radix point.
Links
- Paolo Xausa, Table of n, a(n) for n = 0..10000
- Wikipedia, Non-integer base of numeration.
Formula
a(0) = 1; for n >= 1, a(n) = floor(log_e(n)) + 1.
Comments