|
|
A162276
|
|
a(n) = the smallest positive multiple of n such that, when n and a(n) are written in binary, each has a different number of 1's.
|
|
1
|
|
|
3, 6, 15, 12, 15, 30, 63, 24, 27, 30, 33, 60, 39, 126, 255, 48, 51, 54, 57, 60, 63, 66, 69, 120, 75, 78, 81, 252, 87, 510, 1023, 96, 99, 102, 105, 108, 111, 114, 117, 120, 123, 126, 129, 132, 315, 138, 141, 240, 147, 150, 255, 156, 159, 162, 165, 504, 171, 174, 177
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
a(n)/n = A162277(n), which is odd for all n.
|
|
LINKS
|
|
|
MATHEMATICA
|
spm[n_]:=Module[{k=2, dcn=DigitCount[n, 2, 1]}, While[DigitCount[k*n, 2, 1] == dcn, k++]; k*n]; Array[spm, 60] (* Harvey P. Dale, Mar 14 2015 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|