cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A308730 Smallest prime p for which n is the least number of 1's in the base-2 representation of a multiple of p.

Original entry on oeis.org

2, 3, 7, 89, 31, 13367, 127, 2099863, 178481
Offset: 1

Views

Author

Jeffrey Shallit, Jun 20 2019

Keywords

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.)

Crossrefs

Formula

A086342(a(n)) = n. - Rémy Sigrist, Jul 06 2019