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.

A075288 Interprimes (A024675) which are of the form s*prime, s=13.

This page as a plain text file.
%I A075288 #14 Jul 28 2017 09:56:38
%S A075288 26,39,1313,4771,7033,9607,11947,12233,14963,15613,18707,20527,24323,
%T A075288 26507,27443,30823,31057,33917,36257,43277,45383,48061,48347,48997,
%U A075288 52039,57083,61477,66547,75283,75491,77207,83863,84383,85787,86567
%N A075288 Interprimes (A024675) which are of the form s*prime, s=13.
%C A075288 Interprimes of the form s*prime are in A075277-A075296 ( s = 2 - 21 ). Case s=1 is impossible.
%H A075288 David A. Corneth, <a href="/A075288/b075288.txt">Table of n, a(n) for n = 1..10001</a>
%e A075288 1313 is an interprime and 1313/13 = 101 is prime.
%t A075288 s=13; Select[Table[(Prime[n+1]+Prime[n])/2, {n, 2, 4000}], PrimeQ[ #/s]&]
%t A075288 Select[Mean/@Partition[Prime[Range[2,8500]],2,1],PrimeQ[#/13]&] (* _Harvey P. Dale_, Apr 29 2012 *)
%o A075288 (PARI) first(n) = {my(res = List(), p); forprime(p=2, oo, if(precprime(13*p) + nextprime(13*p) == 26*p, listput(res, 13*p); if(#res>=n, return(res))))} \\ _David A. Corneth_, Jul 26 2017
%Y A075288 Cf. A024675, A075277-A075296.
%K A075288 easy,nonn
%O A075288 1,1
%A A075288 _Zak Seidov_, Sep 12 2002