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.

A022934 Number of 2^m between e^n and e^(n+1).

Original entry on oeis.org

1, 1, 2, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 2, 1
Offset: 0

Views

Author

Keywords

Comments

Obviously each term is either 1 or 2. If n tends to infinity, then Sum(a(i), i=0...n)/n converges to 1/log(2) which is approximately 1.442695. The density of 1's in the sequence is 2-1/log(2) which is 0.5573049591. - Stefan Steinerberger, Apr 16 2006

Programs

  • Mathematica
    Table[Floor[Log[2, E^(n + 1)]] - Floor[Log[2, E^n]], {n, 0, 100}] (* Stefan Steinerberger, Apr 16 2006 *)