This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A024573 #25 Jun 11 2025 01:03:13
%S A024573 1,2,6,1,1,3,35,1,2,5,1,1,2,17,1,2,4,1,1,2,11,1,1,4,1,1,2,8,1,1,3,1,1,
%T A024573 2,7,1,1,3,76,1,2,5,1,1,3,24,1,2,5,1,1,2,14,1,1,4,1,1,2,10,1,1,3,1,1,
%U A024573 2,8,1,1,3,1,1,2,6,1,1,3,38,1,2,5,1,1,2,18,1,2,4,1,1,2,12,1,1,4,1,1,2,9,1
%N A024573 a(n) = floor(1/frac(n*e)).
%C A024573 From _Hieronymus Fischer_, Apr 15 2012: (Start)
%C A024573 The sequence is well defined, since frac(n*e)>0 for n>0.
%C A024573 Let b(n,m) = |{a(k)| 1<=k<=n, a(k)>=m}| be the number of the first n terms which are >= m >= 1. Then, lim b(n,m)/n = 1/m for n-->oo since frac(n*e) is uniformly distributed. (End)
%H A024573 Clark Kimberling, <a href="/A024573/b024573.txt">Table of n, a(n) for n = 1..1000</a>
%F A024573 From _Ridouane Oudra_, Jun 09 2025: (Start)
%F A024573 a(n!) = n.
%F A024573 a(n) = 1 if n is in A190860.
%F A024573 a(n) > 1 if n is in A190847. (End)
%p A024573 seq(floor(1/frac(n*exp(1))), n=1..30); # _Ridouane Oudra_, Jun 09 2025
%t A024573 f[n_] := Floor[1/FractionalPart[n*E]]; Array[f, 100] (* _Robert G. Wilson v_, Apr 17 2012 *)
%Y A024573 Cf. A024584, A022843, A000142, A000027.
%Y A024573 Cf. A190860, A190847.
%K A024573 nonn
%O A024573 1,2
%A A024573 _Clark Kimberling_