The OEIS is supported by the many generous donors to the OEIS Foundation.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #21 Sep 08 2022 08:45:40
%S 3,11,17,29,41,47,53,59,101,113,131,167,173,179,227,239,251,269,281,
%T 383,431,449,461,479,503,509,557,563,593,641,647,677,719,743,773,797,
%U 809,827,887,911,929,953,971,977,983,1019,1049,1061,1163,1193,1217,1229
%N Prime p such that 23p + 10 is prime.
%H Vincenzo Librandi, <a href="/A154613/b154613.txt">Table of n, a(n) for n = 1..1000</a>
%p a := proc (n) if isprime(n) = true and isprime(23*n+10) = true then n else end if end proc: seq(a(n), n = 1 .. 1400); # _Emeric Deutsch_, Jan 21 2009
%t Select[Prime[Range[250]],PrimeQ[23#+10]&] (* _Harvey P. Dale_, Feb 25 2011 *)
%o (Magma) [p: p in PrimesUpTo(2000)|IsPrime(23*p+10)]; // _Vincenzo Librandi_, Jul 31 2012
%Y Cf. A141914 (Primes congruent to 10 mod 23).
%K nonn,easy
%O 1,1
%A _Vincenzo Librandi_, Jan 15 2009
%E Extended by _Emeric Deutsch_, Jan 21 2009