cp's OEIS Frontend

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.

A024573 a(n) = floor(1/frac(n*e)).

Original entry on oeis.org

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, 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, 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
Offset: 1

Views

Author

Keywords

Comments

From Hieronymus Fischer, Apr 15 2012: (Start)
The sequence is well defined, since frac(n*e)>0 for n>0.
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)

Crossrefs

Programs

  • Maple
    seq(floor(1/frac(n*exp(1))), n=1..30); # Ridouane Oudra, Jun 09 2025
  • Mathematica
    f[n_] := Floor[1/FractionalPart[n*E]]; Array[f, 100] (* Robert G. Wilson v, Apr 17 2012 *)

Formula

From Ridouane Oudra, Jun 09 2025: (Start)
a(n!) = n.
a(n) = 1 if n is in A190860.
a(n) > 1 if n is in A190847. (End)