login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A333878
a(n) is the number of primes 2^(n-1) <= p < 2^n with minimal Hamming weight A091935(n-1) in this interval.
3
1, 1, 2, 1, 2, 3, 3, 1, 4, 2, 3, 2, 2, 2, 4, 1, 3, 4, 5, 3, 2, 1, 5, 1, 32, 2, 5, 2, 2, 8, 6, 37, 5, 3, 4, 2, 3, 2, 2, 57, 3, 5, 52, 1, 5, 3, 7, 63, 1, 2, 5, 1, 5, 2, 6, 87, 6, 99, 2, 3, 2, 1, 2, 102, 2, 3, 5, 3, 6, 2, 2, 2, 5, 2, 7, 1, 3, 2, 3, 1, 6, 2, 4, 3, 3
OFFSET
2,3
LINKS
MATHEMATICA
a[2] = 1; a[n_] := Block[{c = 0, nb = 0}, While[c == 0, c = Count[ 2^(n-1) + 1 + Total /@ Subsets[ 2^Range[n - 2], {nb}], x_ /; PrimeQ[x]]; nb++]; c]; Array[a, 90, 2] (* Giovanni Resta, Apr 09 2020 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
Hugo Pfoertner, Apr 08 2020
EXTENSIONS
Terms a(35) and beyond from Giovanni Resta, Apr 09 2020
STATUS
approved