Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A072059
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A072059 Smallest prime p such that 2*p+1 has n distinct prime factors. +0
3
2, 7, 97, 577, 7507, 217717, 5232727, 75172597, 1617423307, 59844662377, 2750790860317, 109455887488447, 4621264673452927, 218071376383127767, 10914293640945722527, 662082573402158125717, 41249727342503299116997 (list; graph; listen)
OFFSET

1,1

COMMENT

Note that for each n=1,...,8, the product of the smallest n-1 distinct prime factors of 2*a(n)+1 is p(n)#/2, where p(n)# is the primorial (A002110) of the n-th prime - and the n-th distinct prime factor >= p(n+1). - Rick L. Shepherd (rshepherd2(AT)hotmail.com), Jul 06 2002

EXAMPLE

a(4)=577=A000040(106): 2*577+1 = 1155 = 11*7*5*3, 4 distinct factors.

PROGRAM

(PARI) for (n=1, 8, p=1; until(isprime(p) && omega(2*p+1)==n, p++); print1(p, ", "))

CROSSREFS

Cf. A001221, A023589, A072055, A072060.

Sequence in context: A056161 A076740 A112290 this_sequence A102344 A087589 A002812

Adjacent sequences: A072056 A072057 A072058 this_sequence A072060 A072061 A072062

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jun 11 2002

EXTENSIONS

More terms from Rick L. Shepherd (rshepherd2(AT)hotmail.com), Jul 06 2002

More terms from Don Reble (djr(AT)nk.ca), Apr 15 2003

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 December 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research