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

A073105
Least k such that there are n primes among the numbers x*2^n + 1 for 1 <= x <= k.
0
1, 3, 9, 12, 14, 12, 26, 46, 38, 49, 59, 46, 90, 73, 141, 117, 114, 127, 179, 151, 131, 238, 305, 250, 245, 258, 290, 468, 384, 345, 497, 403, 495, 502, 564, 543, 576, 624, 575, 561
OFFSET
1,2
PROG
(PARI) a(n)=if(n<0, 0, s=1; while(sum(k=1, s, isprime(k*2^n+1))<n, s++); s)
CROSSREFS
Sequence in context: A168400 A310318 A310319 * A356101 A073536 A077468
KEYWORD
easy,nonn
AUTHOR
Benoit Cloitre, Aug 19 2002
STATUS
approved