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.

A053075 Primes p such that p-30, p, p+30 are consecutive primes.

This page as a plain text file.
%I A053075 #17 Jan 03 2020 10:13:31
%S A053075 69623,110681,134639,228677,237821,250919,303187,318949,396479,421943,
%T A053075 498301,507461,535273,554347,629653,642457,642487,668273,692191,
%U A053075 716033,729821,780553,782611,790927,801247,825161,829319,847423,892321,902903
%N A053075 Primes p such that p-30, p, p+30 are consecutive primes.
%C A053075 Original name: Primes p(k) such that p(k) - p(k-1) = p(k+1) - p(k) = 30.
%H A053075 Zak Seidov, <a href="/A053075/b053075.txt">Table of n, a (n) for n = 1 .. 1000</a>
%F A053075 a(n) = A052195(n) + 30. - _Zak Seidov_, Dec 21 2012
%F A053075 A052195 = { A124596(n) | A124596(n-1) = A124596(n) - 30 }. - _M. F. Hasler_, Jan 02 2020
%e A053075 110681 is separated from both the next lower prime and the next higher prime by 30
%t A053075 lst={}; Do[p=Prime[n]; If[p-Prime[n-1] == Prime[n+1]-p == 6*5, AppendTo[lst,p]], {n,2,2*8!}]; lst (* _Vladimir Joseph Stephan Orlovsky_, May 20 2010 *)
%o A053075 (PARI) is_A053075(n)={precprime(n-1)==n-30&&nextprime(n+1)==n+30&&isprime(n)} \\ _M. F. Hasler_, Jan 02 2020
%Y A053075 Cf. A052195 (a(n)-30: first of the  triplets) and cross-references there.
%Y A053075 Subsequence of A124596 (primes followed by gap 30).
%K A053075 easy,nonn
%O A053075 1,1
%A A053075 _Harvey P. Dale_, Feb 25 2000
%E A053075 Name edited to conform with style sheet and A052195 etc. - _M. F. Hasler_, Jan 02 2020