The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A116417 If n = Sum_{m>=1} 2^(m-1) * b(n,m), where each b(n,m) is 0 or 1 and the sum is a finite sum, then a(n) = denominator of Sum_{m>=1} b(n,m)/m. 8
 1, 1, 2, 2, 3, 3, 6, 6, 4, 4, 4, 4, 12, 12, 12, 12, 5, 5, 10, 10, 15, 15, 30, 30, 20, 20, 20, 20, 60, 60, 60, 60, 6, 6, 3, 3, 2, 2, 1, 1, 12, 12, 12, 12, 4, 4, 4, 4, 30, 30, 15, 15, 10, 10, 5, 5, 60, 60, 60, 60, 20, 20, 20, 20, 7, 7, 14, 14, 21, 21, 42, 42, 28, 28, 28, 28, 84, 84, 84, 84 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS Peter Kagey, Table of n, a(n) for n = 0..10000 EXAMPLE 13 in binary is 1101. So a(13) is the denominator of 1/4 + 1/3 + 1 = 19/12, since the binary digits at positions (from right to left) 1, 3 and 4 are each 1 and the other digits are 0. MATHEMATICA Table[Denominator@ Total@ MapIndexed[#1/ First@ #2 &, Reverse@ IntegerDigits[n, 2]], {n, 0, 79}] (* Michael De Vlieger, Aug 19 2017 *) PROG (PARI) a(n) = {my(b = Vecrev(binary(n))); denominator(sum(k=1, #b, b[k]/k)); } \\ Michel Marcus, Apr 18 2016 CROSSREFS Cf. A007088, A116416, A271410. Sequence in context: A036817 A239962 A175175 * A271410 A196055 A145787 Adjacent sequences:  A116414 A116415 A116416 * A116418 A116419 A116420 KEYWORD easy,frac,nonn AUTHOR Leroy Quet, Feb 13 2006 EXTENSIONS More terms from Joshua Zucker, May 03 2006 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 June 5 12:47 EDT 2020. Contains 334840 sequences. (Running on oeis4.)