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.

A052230 Primes p from A031924 such that A052180(primepi(p)) = 5.

This page as a plain text file.
%I A052230 #14 Aug 15 2018 22:24:04
%S A052230 23,31,53,61,83,151,173,233,263,271,331,353,383,443,503,541,563,571,
%T A052230 593,601,653,751,991,1013,1103,1223,1231,1283,1291,1321,1433,1493,
%U A052230 1553,1613,1621,1741,1861,1973,2011,2063,2131,2281,2333,2341,2371,2393,2543
%N A052230 Primes p from A031924 such that A052180(primepi(p)) = 5.
%H A052230 Robert Israel, <a href="/A052230/b052230.txt">Table of n, a(n) for n = 1..10000</a>
%p A052230 filter:= proc(p) local t,m,flag;
%p A052230   flag:= false;
%p A052230   for t from p+1 to p+5 do
%p A052230     m:= min(numtheory:-factorset(t));
%p A052230     if m > 5 then return false
%p A052230     elif m = 5 then flag:= true
%p A052230     fi
%p A052230   od;
%p A052230   flag
%p A052230 end proc:
%p A052230 Res:= NULL: count:= 0:
%p A052230 q:= 1: p:= 2:
%p A052230 while count < 100 do
%p A052230   q:= p;
%p A052230   p:= nextprime(p);
%p A052230   if p-q = 6 and filter(q) then
%p A052230     count:= count+1; Res:= Res, q;
%p A052230   fi
%p A052230 od:
%p A052230 Res; # _Robert Israel_, Aug 12 2018
%Y A052230 Cf. A031924, A031925, A052180.
%K A052230 nonn
%O A052230 1,1
%A A052230 _Labos Elemer_, Feb 01 2000