|
Search: id:A116417
|
|
|
| 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. |
|
+0
2
|
|
| 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; listen)
|
|
|
OFFSET
|
0,3
|
|
|
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.
|
|
CROSSREFS
|
Cf. A116416, A007088.
Sequence in context: A052473 A051715 A036817 this_sequence A096111 A101081 A038716
Adjacent sequences: A116414 A116415 A116416 this_sequence A116418 A116419 A116420
|
|
KEYWORD
|
easy,frac,nonn
|
|
AUTHOR
|
Leroy Quet (qq-quet(AT)mindspring.com), Feb 13 2006
|
|
EXTENSIONS
|
More terms from Joshua Zucker (joshua.zucker(AT)stanfordalumni.org), May 03 2006
|
|
|
Search completed in 0.002 seconds
|
