A216965 Primes p such that nonprime(p) is odd, where nonprime(1) = 0.

2, 17, 19, 23, 37, 79, 83, 131, 167, 173, 191, 193, 197, 227, 229, 251, 269, 307, 317, 367, 379, 383, 397, 419, 421, 431, 433, 439, 449, 463, 499, 521, 523, 547, 557, 569, 571, 587, 601, 631, 641, 643, 647, 661, 673, 677, 683, 691, 709, 733, 769, 827, 829, 877, 881, 883, 887, 947, 953, 967

Offset

1,1

Links

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000

Example

Nonprime(2) = 1 is odd, so a(1) = 2,
Nonprime(17) = 25 is odd, so a(2) = 17.
Nonprime(19) = 27 is odd, so a(3) = 19.

Prog

(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
(Haskell)
a216965 n = a216965_list !! (n-1)
a216965_list = [p | p <- a000040_list, odd $ a141468 $ fromInteger p]
-- Reinhard Zumkeller, May 31 2013

Crossrefs

Cf. A141468, A155108.

Sequence in context: A074857 A191018 A133247 * A145100 A145101 A176902

Adjacent sequences: A216962 A216963 A216964 * A216966 A216967 A216968

Keyword

nonn,less

Author

Juri-Stepan Gerasimov, May 16 2013

Status

approved