Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #14 Sep 12 2013 14:31:17
%S 2,3,5,7,11,13,19,23,29,31,41,43,47,53,59,61,71,73,79,83,89,101,103,
%T 107,109,113,127,131,137,139,149,151,163,167,173,179,181,191,193,197,
%U 199,211,223,227,229,233,239,241,251,257,263,269,271,277,281,283,293,311
%N Primes p such that (p-2)/5 is not a prime number.
%C The old definition was "Start with the list of primes; accept 2 but remove the list of primes S(2); accept the next prime (3) but remove the list of primes S(3); repeat".
%C If p is a prime, S(p) denotes the list of primes {5p+2, 5(5p+2)+2, 5(5(5p+2)+2)+2, ...}, stopping as soon as we reach the first composite number.
%H Vincenzo Librandi, <a href="/A176162/b176162.txt">Table of n, a(n) for n = 1..1000</a>
%t Select[Prime[Range[100]], !PrimeQ[(# - 2) / 5] &] (* _Vincenzo Librandi_, Sep 12 2013 *)
%Y Cf. A169647.
%K nonn,easy
%O 1,1
%A _Vincenzo Librandi_, Apr 10 2010
%E New definition from _Jon E. Schoenfield_, Jun 18 2010