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.
%I A302692 #27 Feb 03 2019 17:01:45 %S A302692 5,41,47,71,83,101,107,113,733,739,757,827,829,859,863,883,887,947, %T A302692 953,977,983,997,1019,1039,1069,1093,1097,1103,1109,1123,1129,1187, %U A302692 1193,1223,1229,1237,1283,1289,1297,1303,1307,1327,1367,1373,1429,1433,1439,1453,1459 %N A302692 Primes p that are the sum of another prime q and the greatest k such that k! < p. %C A302692 Primes p such that p - A084558(p) is also a prime. %C A302692 Inspired by the fact that this sequence has a nonempty intersection with A124598. %C A302692 Let H be the intersection of this sequence and A124598. With some observed exceptions q = 3, 103, 1013, 1223, 2903, ..., if some p in this sequence is in H then the corresponding q also belongs to H. It is unknown whether H is finite. %C A302692 Based upon the first terms of this sequence, it looks like those k satisfying the definition given in NAME are the even terms of A084558 repeated in certain weakly increasing sequence. %H A302692 Robert Israel, <a href="/A302692/b302692.txt">Table of n, a(n) for n = 1..10000</a> %e A302692 a(3) = 41 since 41 is the third prime that satisfies the given definition(s) for this sequence. Note that A084558(41) = 4; if we subtract: 41-4 = 37, which is also a prime. Also p = 41 and q = 37 are consecutive terms in A124598. %e A302692 a(300) = 49459, because q = 49459 - A084558(49459) = 49451 is a prime and p = 49459 is the 300th prime satisfying such property. Also p and q are consecutive terms in A124598. %p A302692 k:= 0: f:= 1: p:= 1: Res:= NULL: count:= 0: %p A302692 while count < 100 do %p A302692 p:= nextprime(p); %p A302692 while p > f do k:= k+1; f:= f*(k+1) od; %p A302692 if isprime(p-k) then Res:= Res, p; count:= count+1 fi; %p A302692 od: %p A302692 Res; # _Robert Israel_, Jun 10 2018 %t A302692 Select[Prime@ Range[2^8], PrimeQ[# - Block[{k = 1}, While[k! <= #, k++]; k - 1]] &] (* _Michael De Vlieger_, Apr 10 2018 *) %o A302692 (PARI) A084558(n)={my(m=0);while(n\=m++,);m-1} %o A302692 firstTerms(U)={my(L:list=List());forprime(p=2,nextprime(U),if(ispseudoprime(p-A084558(p)),listput(L,p)));return(Vec(L))} %Y A302692 Cf. A084558, A124598. %K A302692 nonn,look %O A302692 1,1 %A A302692 _R. J. Cano_, Apr 08 2018