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 A022924 #26 Jan 06 2023 23:25:03 %S A022924 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, %T A022924 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, %U A022924 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 %N A022924 Number of 3^m between 2^n and 2^(n+1). %C A022924 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 %H A022924 David A. Corneth, <a href="/A022924/b022924.txt">Table of n, a(n) for n = 0..9999</a> %o A022924 (PARI) a(n) = logint(2^(n+1),3)-logint(2^n,3) \\ _Charles R Greathouse IV_, Jan 16 2017 %Y A022924 Cf. A136409 (partial sums). %Y A022924 First differences of A020915. %K A022924 nonn %O A022924 0,1 %A A022924 _Clark Kimberling_