|
%I #17 Apr 11 2020 15:32:07
%S 2,5,13,17,41,97,193,257,769,1153,2113,4129,12289,18433,40961,65537,
%T 163841,270337,786433,1179649,2101249,4194433,8650753,16777729,
%U 50332673,69206017,167772161,270532609,537133057,1107296257,3221225473,6442713089,8858370049
%N a(n) is the largest prime 2^(n-1) <= p < 2^n minimizing the Hamming weight of all primes in this interval.
%H Chai Wah Wu, <a href="/A333876/b333876.txt">Table of n, a(n) for n = 2..1000</a>
%o (PARI) for(n=2, 10, my(hmin=n+n,pmax); forprime(p=2^(n-1), 2^n, my(h=hammingweight(p)); if(h<=hmin,pmax=p;hmin=h)); print1(pmax,", "))
%o (Python)
%o from sympy import isprime
%o from sympy.utilities.iterables import multiset_permutations
%o def A333876(n):
%o for i in range(n):
%o q = 2**n-1
%o for d in multiset_permutations('0'*i+'1'*(n-1-i)):
%o p = q-int(''.join(d),2)
%o if isprime(p):
%o return p # _Chai Wah Wu_, Apr 08 2020
%Y Cf. A066195, A091936, A333877, A333878.
%K nonn
%O 2,1
%A _Hugo Pfoertner_, Apr 08 2020
|
