id:A022934 - OEIS Search Results

Search: id:A022934

Displaying 1-1 of 1 results found.

page 1

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

+0
3

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 (list; graph; listen)

	OFFSET	`0,3`
	COMMENT	`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 (stefan.steinerberger(AT)gmail.com), Apr 16 2006`
	MATHEMATICA	`Table[Floor[Log[2, E^(n + 1)]] - Floor[Log[2, E^n]], {n, 0, 100}] - Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Apr 16 2006`
	CROSSREFS	`Sequence in context: A103587 A100387 A081129 this_sequence A107450 A104248 A069349` `Adjacent sequences: A022931 A022932 A022933 this_sequence A022935 A022936 A022937`
	KEYWORD	`nonn`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified November 25 08:46 EST 2009. Contains 167481 sequences.

AT&T Labs Research