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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A194759 Number of k such that {k*log(2)} > {n*log(2)}, where { } = fractional part. 3
 0, 1, 2, 0, 2, 4, 0, 3, 6, 0, 4, 8, 12, 3, 8, 13, 2, 8, 14, 1, 8, 15, 0, 8, 16, 24, 6, 15, 24, 4, 14, 24, 2, 13, 24, 0, 12, 24, 36, 9, 22, 35, 6, 20, 34, 3, 18, 33, 0, 16, 32, 48, 12, 29, 46, 8, 26, 44, 4, 23, 42, 0, 20, 40, 60, 15, 36, 57, 10, 32, 54, 5, 28, 51, 0, 24, 48 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS Table of n, a(n) for n=1..77. MATHEMATICA r = Log[2]; p[x_] := FractionalPart[x]; u[n_, k_] := If[p[k*r] <= p[n*r], 1, 0] v[n_, k_] := If[p[k*r] > p[n*r], 1, 0] s[n_] := Sum[u[n, k], {k, 1, n}] t[n_] := Sum[v[n, k], {k, 1, n}] Table[s[n], {n, 1, 100}] (* A194758 *) Table[t[n], {n, 1, 100}] (* A194759 *) CROSSREFS Cf. A194758, A194738. Sequence in context: A368500 A209699 A115273 * A209697 A126440 A131186 Adjacent sequences: A194756 A194757 A194758 * A194760 A194761 A194762 KEYWORD nonn AUTHOR Clark Kimberling, Sep 02 2011 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 June 24 02:53 EDT 2024. Contains 373661 sequences. (Running on oeis4.)