A143027 Sturdy prime numbers: p such that in binary notation k*p has at least as many 1-bits as p for all k > 0.

2, 3, 5, 7, 17, 31, 73, 89, 127, 257, 1801, 2089, 8191, 65537, 131071, 178481, 262657, 524287, 2099863, 616318177, 2147483647, 4432676798593

Offset

1,1

Comments

The primes in A125121. This sequence includes the Fermat primes (A019434), Mersenne primes (A000668) and the three known primes in A051154. It appears that almost all primes are flimsy numbers, A005360.

Odd sturdy primes appear to be the largest primitive prime factor of 2^q-1 for q a prime or prime power. The values of q for the current terms: 2, 4, 3, 8, 5, 9, 11, 16, 25, 29, 13, 32, 17, 23, 27 and 19. The sequence probably continues with 2099863, 6700417, 13264529, 20394401, 97685839.

From T. D. Noe, Mar 01 2010: (Start)

Max Alekseyev reports that 6700417, 13264529, 20394401, and 97685839 are not sturdy because each number divides a number having fewer 1-bits: 6700417 divides 2^32 + 1, 13264529 divides 331613225, 20394401 divides 1611157679, and 97685839 divides 18014398643699713. He conjectures that 616318177 is the next term.

If q is a prime power, q = r^s, then the primitive part of 2^q-1 is (2^r^s-1)/(2^r^(s-1)-1). According to Stolarsky's Theorem 2.1, this primitive part is sturdy. If the primitive part is prime, then it is in this sequence. Hence 7^2 produces the sturdy prime 4432676798593 and 59^2 produces a 1031-digit sturdy prime. (End)

Clokie et al. verify that the next two sturdy primes after 2099863 are 616318177 and 2147483647. These are all up to 2^32. Two additional sturdy primes are 57912614113275649087721 = (2^83 - 1)/167 and 10350794431055162386718619237468234569 = (2^131 - 1)/263, but probably there are some in between these and 2147483647. Jeffrey Shallit, Feb 10 2020

From Jason Yuen, Mar 30 2024: (Start)

For all x>log_2(p), 1+A000120(p-(2^x mod p)) >= A000120(p). This follows from the fact that 2^x+p-(2^x mod p) is a multiple of p.

a(23) > 5*10^12. See a143027_5e12.txt for more details. (End)

Links

Table of n, a(n) for n=1..22.

Trevor Clokie et al., Computational Aspects of Sturdy and Flimsy Numbers, arxiv preprint arXiv:2002.02731 [cs.DS], February 7 2020.

K. B. Stolarsky, Integers whose multiples have anomalous digital frequencies, Acta Arithmetica, 38 (1980), 117-128.

Jason Yuen, a143027_5e12.txt. This file shows that a(23) > 5*10^12.

Crossrefs

Cf. A125121, A181863, A000120.

Sequence in context: A103384 A103383 A103382 * A001153 A141453 A100532

Adjacent sequences: A143024 A143025 A143026 * A143028 A143029 A143030

Keyword

more,nice,nonn,base

Author

T. D. Noe, Jul 17 2008, Jul 21 2008

Extensions

2089 and 8191 were found by Ray Chandler

2099863 added by T. D. Noe, Mar 01 2010

616318177, 2147483647 added by Jeffrey Shallit, Feb 10 2020

4432676798593 added by Jason Yuen, Mar 30 2024

Status

approved