cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A098027 Smallest prime p such that p+2 is a product of exactly n distinct primes.

This page as a plain text file.
%I A098027 #14 Oct 19 2017 03:14:36
%S A098027 3,13,103,1153,15013,255253,4849843,111546433,4360010653,100280245063,
%T A098027 5245694198743,152125131763603,7149881192889433,421842990380476663,
%U A098027 16294579238595022363,1106494163767990292293,74135108972455349583763
%N A098027 Smallest prime p such that p+2 is a product of exactly n distinct primes.
%C A098027 In most cases a(n) = pn! - 2, where pn! is "factorial of odd primes": from 3 to n-th odd prime. - Zak Seidov - _Zak Seidov_ and _Don Reble_, Mar 10 2006
%e A098027 3+2=5 (1 prime), 13+2=15=3*5 (2 primes), 103+2=105=3*5*7 (3 primes), ...
%e A098027 1153 is the 4th entry in the sequence because it is followed by primes 1783, 1993, 2143, 2803, ... with the property 1153+2 = 3*5*7*11, 1783+2 = 3*5*7*17, 1993+2 = 3*5*7*19, 2143+2 = 3*5*11*13, 2803+2 = 3*5*11*17, ...
%Y A098027 Cf. A067024 [From _R. J. Mathar_, Sep 02 2008]
%K A098027 nonn
%O A098027 1,1
%A A098027 _Lekraj Beedassy_, Sep 10 2004
%E A098027 Extended by _Ray Chandler_, Sep 18 2004
%E A098027 More terms from _Zak Seidov_ and _Don Reble_, Mar 10 2006
%E A098027 Corrected by _Don Reble_, Apr 03 2006