|
| |
|
|
A140451
|
|
a(1) = 1. a(n) = the smallest positive multiple of a(n-1) with exactly n 1's in its binary representation.
|
|
0
| | |
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| Each term is odd.
Can it be proved that there always is a positive multiple of each a(n-1) that has exactly n binary 1's? Or is the {a(k)} sequence finite?
a(10) <= 1 + 2^100 + 2^236 + 2^238 + 2^341 + 2^542 + 2^566 + 2^568 + 2^674 + 2^723. [From Max Alekseyev, Oct 12 2008]
|
|
|
CROSSREFS
| Sequence in context: A134057 A128281 A034268 * A054147 A043012 A122120
Adjacent sequences: A140448 A140449 A140450 * A140452 A140453 A140454
|
|
|
KEYWORD
| base,more,nonn
|
|
|
AUTHOR
| Leroy Quet Jul 21 2008
|
|
|
EXTENSIONS
| First 8 terms calculated by Richard Mathar and Jack Brennen.
a(9) from Max Alekseyev, Jul 22 2008
|
| |
|
|
