login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A098028 Smallest prime p such that p-2 is a product of exactly n distinct primes. 1
5, 17, 107, 1367, 15017, 285287, 6561557, 179444267, 3234846617, 100280245067, 3710369067407, 196649560572467, 8309321386330967, 307444891294245707, 24615215445537161447, 961380175077106319537, 78523577350789412776937 (list; graph; refs; listen; history; internal format)
OFFSET

1,1

EXAMPLE

1367 is the 4-th entry in the sequence because it is followed by primes 1997, 2417, 3137, 3257, ... with the property 1367-2 = 3*5*7*13, 1997-2 = 3*5*7*19, 2417-2 = 3*5*7*23, 3137-2 = 3*5*11*19, 3257-2 = 3*5*7*31, ...

MATHEMATICA

Do[s = 3; While[ ! (Length[FactorInteger[Prime[s] - 2]] == n && Max[Last /@ FactorInteger[Prime[s] - 2]] == 1), s++ ]; Print[Prime[s]], {n, 1, 8}] (Propper)

CROSSREFS

Sequence in context: A034821 A158007 A143562 * A100301 A096178 A084167

Adjacent sequences:  A098025 A098026 A098027 * A098029 A098030 A098031

KEYWORD

nonn

AUTHOR

Lekraj Beedassy (blekraj(AT)yahoo.com), Sep 10 2004

EXTENSIONS

Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Sep 18 2004

One more term from Ryan Propper (rpropper(AT)stanford.edu), Sep 01 2005

More terms from Don Reble (djr(AT)nk.ca), Apr 03 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 10:05 EST 2012. Contains 206009 sequences.