Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A073105
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A073105 Least k such there are n primes among the numbers x*2^n+1 for 1<=x<=k. +0
1
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 (list; graph; listen)
OFFSET

1,2

PROGRAM

(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: A069871 A061957 A136984 this_sequence A073536 A077468 A089425

Adjacent sequences: A073102 A073103 A073104 this_sequence A073106 A073107 A073108

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 19 2002

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research