|
|
A101082
|
|
Numbers n such that binary representation contains bit strings "10" and "01" (possibly overlapping).
|
|
15
|
|
|
5, 9, 10, 11, 13, 17, 18, 19, 20, 21, 22, 23, 25, 26, 27, 29, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 49, 50, 51, 52, 53, 54, 55, 57, 58, 59, 61, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Complement of A023758. Also numbers not the sum of consecutive powers of 2. - Omar E. Pol, Mar 04 2013
The terms >=9 are bases in which a power of 2 exists, which does not contain a digit that is a power of 2. - Patrick Wienhöft, Jul 28 2016
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
In base 10, 2^16 = 65536 is such a number, as it does not contain any one-digit power of 2, which in base 10 are 1, 2, 4 and 8. - Patrick Wienhöft, Jul 28 2016
|
|
MATHEMATICA
|
Select[Range@ 120, Function[d, Times @@ Total@ Map[Map[Function[k, Boole@ MatchQ[#, k]], {{1, 0}, {0, 1}}] &, Partition[d, 2, 1]] > 0]@ IntegerDigits[#, 2] &] (* Michael De Vlieger, Dec 23 2016 *)
|
|
PROG
|
(Haskell)
a101082 n = a101082_list !! (n-1)
a101082_list = filter ((> 0) . a049502) [0..]
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|