login
A147756
a(n) = the smallest integer m such that n = (the largest integer that, when represented in binary, occurs at least twice as a substring in the binary representation of m).
2
4, 3, 10, 7, 36, 21, 54, 15, 136, 73, 42, 91, 204, 109, 238, 31, 528, 273, 146, 307, 660, 85, 182, 375, 792, 409, 858, 219, 924, 477, 990, 63, 2080, 1057, 546, 1123, 292, 1189, 614, 1255, 2600, 1321, 170, 1387, 2860, 365, 750, 1519, 3120, 1585, 3250, 819, 3380
OFFSET
0,1
COMMENTS
The substrings (each equal to the binary representation of n) may overlap in the binary representation of a(n). a(n) = the smallest positive integer such that A147755(a(n)) = n.
LINKS
EXAMPLE
21 in binary is 10101. 101 (5 in decimal) occurs twice in 10101: (101)01 and 10(101). Since no larger integer (when represented in binary) occurs more than once within 10101 and since no smaller integer (represented in binary) contains the substring 101 within it at least twice, then a(5) = 21.
CROSSREFS
Cf. A147755.
Sequence in context: A275160 A363469 A369710 * A213768 A325997 A075563
KEYWORD
base,nonn
AUTHOR
Leroy Quet, Nov 11 2008
EXTENSIONS
Extended by Ray Chandler, Nov 14 2008
STATUS
approved