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.

A052190 Primes p such that p, p+24, p+48 are consecutive primes.

This page as a plain text file.
%I A052190 #22 Feb 28 2025 05:56:15
%S A052190 16763,40039,42509,96353,98573,104183,119243,123863,160093,161783,
%T A052190 169259,181789,185243,208529,209719,232753,235699,243343,246049,
%U A052190 260339,261799,270073,295363,295703,302459,315199,331399,362003,364079,373669,380729,381793,385943,414809
%N A052190 Primes p such that p, p+24, p+48 are consecutive primes.
%C A052190 Old name was "Primes p(k) such that p(k+2)-p(k+1)=p(k+1)-p(k)=24."
%H A052190 Amiram Eldar, <a href="/A052190/b052190.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1000 from Harvey P. Dale)
%e A052190 40039 is followed by 40063 and 40087, consecutive primes with equal distance of 24.
%t A052190 Select[Partition[Prime[Range[40000]],3,1],Differences[#]=={24,24}&][[All,1]] (* _Harvey P. Dale_, May 09 2019 *)
%o A052190 (PARI) list(lim) = {my(p1 = 2, p2 = 3); forprime(p3 = 5, lim, if(p2 - p1 == 24 && p3 - p2 == 24, print1(p1, ", ")); p1 = p2; p2 = p3);} \\ _Amiram Eldar_, Feb 28 2025
%Y A052190 Subsequence of A098974.
%Y A052190 Cf. A001223, A033451, A047948, A052188, A052189.
%K A052190 nonn
%O A052190 1,1
%A A052190 _Labos Elemer_, Jan 28 2000
%E A052190 Name changed by _Jon E. Schoenfield_, May 30 2018