login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A116416 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) = numerator of sum{m>=1} b(n,m)/m. 1
0, 1, 1, 3, 1, 4, 5, 11, 1, 5, 3, 7, 7, 19, 13, 25, 1, 6, 7, 17, 8, 23, 31, 61, 9, 29, 19, 39, 47, 107, 77, 137, 1, 7, 2, 5, 1, 3, 1, 2, 5, 17, 11, 23, 3, 7, 5, 9, 11, 41, 13, 28, 7, 17, 6, 11, 37, 97, 67, 127, 19, 39, 29, 49, 1, 8, 9, 23, 10, 31, 41, 83, 11, 39, 25, 53, 61, 145, 103, 187 (list; graph; refs; listen; history; internal format)
OFFSET

0,4

EXAMPLE

13 in binary is 1101. So a(13) is the numerator 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.

CROSSREFS

Cf. A116417, A007088.

Sequence in context: A105177 A050057 A104449 * A051203 A194540 A193043

Adjacent sequences:  A116413 A116414 A116415 * A116417 A116418 A116419

KEYWORD

easy,frac,nonn

AUTHOR

Leroy Quet Feb 13 2006

EXTENSIONS

More terms from Joshua Zucker (joshua.zucker(AT)stanfordalumni.org), May 03 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 21:51 EST 2012. Contains 205978 sequences.