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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A022924 Number of 3^m between 2^n and 2^(n+1). 2
0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
This is a Sturmian sequence; consider the straight line of equation y = x*log(3)/log(2), the sequence gives the number m of integer ordinate points between the abscissa points n and n+1. - Richard Aime Blavy, Jun 14 2020
LINKS
PROG
(PARI) a(n) = logint(2^(n+1), 3)-logint(2^n, 3) \\ Charles R Greathouse IV, Jan 16 2017
CROSSREFS
Cf. A136409 (partial sums).
First differences of A020915.
Sequence in context: A174282 A189301 A123640 * A295893 A157412 A373223
KEYWORD
nonn
AUTHOR
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 4 21:56 EDT 2024. Contains 375685 sequences. (Running on oeis4.)