The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A022923 Number of integers m such that 7^n < 2^m < 7^(n+1). 1
 2, 3, 3, 3, 3, 2, 3, 3, 3, 3, 2, 3, 3, 3, 3, 2, 3, 3, 3, 3, 2, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 2, 3, 3, 3, 3, 2, 3, 3, 3, 3, 2, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 2, 3, 3, 3, 3, 2, 3, 3, 3, 3, 2, 3, 3, 3, 3, 2, 3, 3, 3, 3, 3, 2, 3, 3, 3, 3, 2, 3, 3, 3, 3, 2, 3, 3, 3, 3, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 LINKS Harvey P. Dale, Table of n, a(n) for n = 0..1000 FORMULA Asymptotic mean: lim_{m->oo} (1/m) * Sum_{k=1..m} a(k) = log_2(7) (A020860). - Amiram Eldar, Mar 01 2024 EXAMPLE From Amiram Eldar, Mar 01 2024: (Start) a(0) = 2 because 7^0 = 1 < 2^1 = 2 < 2^2 = 4 < 7^1 = 7. a(1) = 3 because 7^1 = 7 < 2^3 = 8 < 2^4 = 16 < 2^3 = 32 < 7^2 = 49. a(2) = 3 because 7^2 = 49 < 2^6 = 64 < 2^7 = 128 < 2^8 = 256 < 7^3 = 343. (End) MATHEMATICA Differences[Floor[Log2[7^Range[0, 100]]]] (* Harvey P. Dale, Jun 23 2019 *) CROSSREFS Cf. A020860, A022921, A022922. Sequence in context: A089326 A359514 A237367 * A276858 A247656 A294081 Adjacent sequences: A022920 A022921 A022922 * A022924 A022925 A022926 KEYWORD nonn,easy AUTHOR Clark Kimberling STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 18 18:59 EDT 2024. Contains 374388 sequences. (Running on oeis4.)