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 A022934 #17 May 03 2025 04:10:06
%S A022934 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,
%T A022934 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,
%U A022934 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
%N A022934 Number of 2^m between e^n and e^(n+1).
%C A022934 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
%H A022934 Georg Fischer, <a href="/A022934/b022934.txt">Table of n, a(n) for n = 0..1000</a>
%t A022934 Table[Floor[Log[2, E^(n + 1)]] - Floor[Log[2, E^n]], {n, 0, 100}] (* _Stefan Steinerberger_, Apr 16 2006 *)
%K A022934 nonn
%O A022934 0,3
%A A022934 _Clark Kimberling_