A098026 Smallest prime p such that p+1 is the product of exactly n distinct prime numbers.

2, 5, 29, 389, 2309, 30029, 570569, 11741729, 300690389, 10407767369, 239378649509, 9426343036109, 304250263527209, 18740171637257069, 693386350578511589, 37508276737897976009, 2925030695773453637369, 141143645364710083725629, 8327475076517894939812169

Offset: 1

Author

Lekraj Beedassy, Sep 10 2004

Keywords

• nonn

Examples

			a(4) = 389 because 389+1 = 2*3*5*13.
		

Links

• Max Alekseyev, Table of n, a(n) for n = 1..100

Crossrefs

Cf. A073918 (least prime p such that p-1 has exactly n distinct prime factors).

Programs

Mathematica

Generate[pIndex_, i_] := Module[{p2, t}, p2=pIndex; While[p2[[i]]++; Do[p2[[j]]=p2[[i]]+j-i, {j, i+1, Length[p2]}]; t=Times@@Prime[p2]; tT. D. Noe, Dec 13 2004 *)

Extensions

Corrected and extended by Ray Chandler, Sep 18 2004

Further corrected and extended by T. D. Noe, Dec 13 2004

a(14) corrected and terms a(18) onward added by Max Alekseyev, Mar 16 2023