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.

A243410 Primes p such that 1000p-1, 1000p-3, 1000p-7 and 1000p-9 are all prime.

This page as a plain text file.
%I A243410 #8 Jun 06 2014 14:45:15
%S A243410 10193,13217,34457,36767,57773,76631,103043,157823,191033,194813,
%T A243410 212243,229799,242273,242867,249377,256889,261563,264071,361511,
%U A243410 457871,486293,502841,508517,647837,653621,694409,697511,777437,798143,825611,847031
%N A243410 Primes p such that 1000p-1, 1000p-3, 1000p-7 and 1000p-9 are all prime.
%C A243410 Primes in A064977.
%e A243410 10193 is prime and 1000*10193-1 = 10192999 is prime, 1000*10193-3 = 10192997 is prime, 1000*10193-7 = 10192993 is prime and 1000*10193-9 = 10192991 is prime. Thus 10193 is a member of this sequence.
%o A243410 (Python)
%o A243410 import sympy
%o A243410 from sympy import isprime
%o A243410 from sympy import prime
%o A243410 {print(prime(n),end=', ') for n in range(1,10**5) if isprime(1000*prime(n)-1) and isprime(1000*prime(n)-3) and isprime(1000*prime(n)-7) and isprime(1000*prime(n)-9)}
%o A243410 (PARI) for(n=1,10^5,if(ispseudoprime(1000*prime(n)-1) && ispseudoprime(1000*prime(n)-3) && ispseudoprime(1000*prime(n)-7) && ispseudoprime(1000*prime(n)-9),print1(prime(n),", ")))
%Y A243410 Cf. A242562, A064977.
%K A243410 nonn,less
%O A243410 1,1
%A A243410 _Derek Orr_, Jun 04 2014