The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A292349 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A292349

Pri-most primes: primes p such that the majority of bits in the binary representation of p satisfy the following: complementing this bit produces a prime number.
(history; published version)

#23 by Michael De Vlieger at Sun Oct 06 09:44:51 EDT 2024

STATUS

reviewed

approved

#22 by Stefano Spezia at Sun Oct 06 09:37:48 EDT 2024

STATUS

proposed

reviewed

#21 by Lucas A. Brown at Sat Oct 05 23:14:23 EDT 2024

STATUS

editing

proposed

#20 by Lucas A. Brown at Sat Oct 05 23:14:22 EDT 2024

KEYWORD

nonn,base,more,hard,changed

#19 by Lucas A. Brown at Sat Oct 05 23:14:13 EDT 2024

COMMENTS

Any further terms are > 10^12. - Lucas A. Brown, Oct 05 2024

STATUS

approved

editing

#18 by Peter Luschny at Mon May 24 07:33:39 EDT 2021

STATUS

reviewed

approved

#17 by Joerg Arndt at Mon May 24 05:49:07 EDT 2021

STATUS

proposed

reviewed

#16 by F. Chapoton at Mon May 24 05:05:38 EDT 2021

STATUS

editing

proposed

#15 by F. Chapoton at Mon May 24 05:05:31 EDT 2021

PROG

from sympy import isprime, primerange

for i in rangeprimerange(1, 1000000, 21000):

if not isprime(i): continue

foundPrime = nonPrime delta = 0

if isprime(i^bit): foundPrime delta += 1

else: nonPrime +delta -= 1

if foundPrime delta > nonPrime0: print (str(i)+, end=', ', )

STATUS

approved

editing

Discussion

Mon May 24

05:05

F. Chapoton: adapt py code to py3

#14 by N. J. A. Sloane at Sat Dec 07 12:18:29 EST 2019

PROG

for i in xrangerange(1, 1000000, 2):

Discussion

Sat Dec 07

12:18

OEIS Server: https://oeis.org/edit/global/2837