This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A140130 a(n) = denominator of c(n) = if n=1 then 1 else if n < 3*2^[Log2(n)-1] then (c([n/2])+c([(n+1)/2]))/2 else c(n-2^[Log2(n)])+1;. 3
 1, 1, 1, 1, 2, 1, 1, 1, 4, 2, 4, 1, 2, 1, 1, 1, 8, 4, 8, 2, 8, 4, 8, 1, 4, 2, 4, 1, 2, 1, 1, 1, 16, 8, 16, 4, 16, 8, 16, 2, 16, 8, 16, 4, 16, 8, 16, 1, 8, 4, 8, 2, 8, 4, 8, 1, 4, 2, 4, 1, 2, 1, 1, 1, 32, 16, 32, 8, 32, 16, 32, 4, 32, 16, 32, 8, 32, 16, 32, 2, 32, 16, 32, 8, 32, 16, 32, 4, 32, 16 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 COMMENTS a(n) = if n=1 then 1 else if n < 3*2^[Log2(n)-1] then (if n mod 2 = 0 then a(n/2) else 2^[Log2(n)-1]) else a(n-[Log2(n)]); for n>1: A140130(A023758(n)) = 1. see A140129 for further comments and examples. LINKS R. Zumkeller, Table of n, a(n) for n = 1..8191 CROSSREFS Sequence in context: A100092 A131508 A305502 * A321312 A220632 A125653 Adjacent sequences:  A140127 A140128 A140129 * A140131 A140132 A140133 KEYWORD nonn,frac AUTHOR Reinhard Zumkeller, May 14 2008 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
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 15 16:25 EST 2019. Contains 320136 sequences. (Running on oeis4.)