|
Search: id:A101319
|
|
|
| A101319 |
|
a(1) = 1; a(n) = (largest odd divisor of a(n-1))th smallest positive integer not yet in the sequence. |
|
+0
2
|
|
| 1, 2, 3, 6, 7, 12, 8, 4, 5, 14, 17, 28, 18, 21, 35, 50, 40, 15, 30, 31, 51, 72, 23, 43, 66, 56, 20, 16, 9, 27, 54, 55, 87, 120, 38, 45, 79, 115, 153, 192, 13, 37, 73, 112, 26, 41, 81, 126, 105, 152, 52, 42, 59, 104, 44, 36, 33, 78, 88, 46, 67, 124, 80, 24, 19, 64, 10, 32, 11, 58
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
It seems likely, but not certain, that this sequence is a permutation of the positive integers, which it is if and only if there are an infinite number of powers of 2 in the sequence.
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
EXAMPLE
|
a(6) = 12 and the highest odd divisor of 12 is 3. Among the first 6 terms of the sequence is not 4, 5, 8, 9,... and the 3rd of these is 8, which is therefore a(7).
|
|
CROSSREFS
|
Sequence in context: A032842 A023773 A115889 this_sequence A030013 A130404 A064689
Adjacent sequences: A101316 A101317 A101318 this_sequence A101320 A101321 A101322
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet Dec 23 2004
|
|
EXTENSIONS
|
More terms from Hans Havermann (pxp(AT)rogers.com), Dec 24 2004
|
|
|
Search completed in 0.002 seconds
|
