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 #22 May 31 2013 16:51:46
%S 2,17,19,23,37,79,83,131,167,173,191,193,197,227,229,251,269,307,317,
%T 367,379,383,397,419,421,431,433,439,449,463,499,521,523,547,557,569,
%U 571,587,601,631,641,643,647,661,673,677,683,691,709,733,769,827,829,877,881,883,887,947,953,967
%N Primes p such that nonprime(p) is odd, where nonprime(1) = 0.
%H Reinhard Zumkeller, <a href="/A216965/b216965.txt">Table of n, a(n) for n = 1..10000</a>
%e Nonprime(2) = 1 is odd, so a(1) = 2,
%e Nonprime(17) = 25 is odd, so a(2) = 17.
%e Nonprime(19) = 27 is odd, so a(3) = 19.
%o (PARI) print1(p=2);np=1; forprime(q=3,1e3, while(p<q, while(isprime(np++),);p++); if(np%2, print1(", "q))) \\ _Charles R Greathouse IV_, May 17 2013
%o (Haskell)
%o a216965 n = a216965_list !! (n-1)
%o a216965_list = [p | p <- a000040_list, odd $ a141468 $ fromInteger p]
%o -- _Reinhard Zumkeller_, May 31 2013
%Y Cf. A141468, A155108.
%K nonn,less
%O 1,1
%A _Juri-Stepan Gerasimov_, May 16 2013