|
|
A160899
|
|
a(n) = the smallest positive multiple of n that has exactly a prime number of 1's in its binary representation.
|
|
3
|
|
|
3, 6, 3, 12, 5, 6, 7, 24, 9, 10, 11, 12, 13, 14, 285, 48, 17, 18, 19, 20, 21, 22, 69, 24, 25, 26, 81, 28, 87, 570, 31, 96, 33, 34, 35, 36, 37, 38, 117, 40, 41, 42, 129, 44, 405, 138, 47, 48, 49, 50, 357, 52, 265, 162, 55, 56, 171, 174, 59, 1140, 61, 62, 4221, 192, 65, 66, 67
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
MATHEMATICA
|
spm[n_]:=Module[{k=1}, While[!PrimeQ[DigitCount[k*n, 2, 1]], k++]; k*n]; Array[ spm, 70] (* Harvey P. Dale, Apr 03 2022 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|