|
%I #13 Jun 28 2014 16:26:57
%S 2,3,2,3,19,23,29,41,2,7,13,19,23,31,71,71,73,73,79,109,137,149,197,
%T 197,257,263,263,311,349,349,337,349,383,383,421,433,23,29,23,19,17,
%U 31,71,131,139,223,263,293,293,521,557,593,613,631,823,911,919,919,947,1109,1427,1487,1483,1613,1693,1913,2131,2203,2381,2659
%N Primes of the form prime(prime(n)) mod prime(n), sorted by increasing n.
%C This scans A004648(A000040(.)) = 1, 2, 1, 3, 9, 2, 8, 10,... , and discards composites.
%e a(1)=2 because (prime(prime(2))=5 mod prime(2)=3)=2=prime.
%o (PARI) s=[]; for(n=1, 3000, p=prime(prime(n))%prime(n); if(isprime(p), s=concat(s, p))); s \\ _Colin Barker_, Jun 28 2014
%Y Cf. A000040, A004648.
%K nonn,less
%O 1,1
%A _Juri-Stepan Gerasimov_, Dec 12 2010
%E Terms corrected by _R. J. Mathar_, Dec 17 2010
|
