login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A308730 Smallest prime p for which n is the least number of 1's in the base-2 representation of a multiple of p. 0
2, 3, 7, 89, 31, 13367, 127, 2099863, 178481 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
It is not known if a(n) actually exists for all n. If there are infinitely many Mersenne primes, then a(n) is defined for infinitely many n.
The corresponding multipliers for n = 1,2,...,7 are 1,1,1,1,1,5,1,1,1. (Computations done by Leon Witzman.)
LINKS
K. B. Stolarsky, Integers whose multiples have anomalous digital frequencies, Acta Arithmetica 38 (1980), 117-128, DOI:10.4064/aa-38-2-117-128.
FORMULA
A086342(a(n)) = n. - Rémy Sigrist, Jul 06 2019
CROSSREFS
Sequence in context: A288800 A247025 A053964 * A062578 A062529 A308917
KEYWORD
nonn,base,more
AUTHOR
Jeffrey Shallit, Jun 20 2019
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 04:13 EDT 2024. Contains 371235 sequences. (Running on oeis4.)