This site is supported by donations to The OEIS Foundation.

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A194760 Number of k such that {-k*log(2)} < {-n*log(2)}, where { } = fractional part. 3
 1, 2, 3, 1, 3, 5, 1, 4, 7, 1, 5, 9, 13, 4, 9, 14, 3, 9, 15, 2, 9, 16, 1, 9, 17, 25, 7, 16, 25, 5, 15, 25, 3, 14, 25, 1, 13, 25, 37, 10, 23, 36, 7, 21, 35, 4, 19, 34, 1, 17, 33, 49, 13, 30, 47, 9, 27, 45, 5, 24, 43, 1, 21, 41, 61, 16, 37, 58, 11, 33, 55, 6, 29, 52, 1, 25, 49 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS 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}]   (* A194760 *) Table[t[n], {n, 1, 100}]   (* A194761 *) CROSSREFS Cf. A194761. Sequence in context: A214582 A050375 A154722 * A035517 A099471 A243574 Adjacent sequences:  A194757 A194758 A194759 * A194761 A194762 A194763 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 | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.