This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A009190 2p twin peaks: a(n) = least x with lpf(x) = lpf(x + 2p) = p = prime(n) and lpf(y) < p for all x < y < x + 2p, where lpf = least prime factor. 1
 7310131732015251470110369, 2061519317176132799110061, 3756800873017263196139951, 6316254452384500173544921 (list; graph; refs; listen; history; text; internal format)
 OFFSET 20,1 COMMENTS For prime p, a 2p-twin peak is a number x such that lpf(x) = lpf(x+2p) = p and x < y < x+2p => lpf(y) < p. (lpf(n) = least prime factor of n). p = 71 is the smallest prime admitting a 2p-twin peak. REFERENCES Various postings to math-fun mailing list, 1996-1997. LINKS Eric Weisstein's World of Mathematics, Twin peaks FORMULA a(n) < A002110(n)/2, since if (x,x+2p) is a 2p-twin peak, then so is (q-x-2p,q-x), where q=A034386(p). - M. F. Hasler, Jan 28 2014 PROG (PARI) is_TwinPeak(x)={forstep(k=2, 2*p=factor(x)[1, 1], 2, factor(x+k, p)[1, 1]

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 14 15:02 EST 2018. Contains 318098 sequences. (Running on oeis4.)