A171016 In the sequence of prime numbers, replace all the '3' digits with '0' and vice versa.

2, 0, 5, 7, 11, 10, 17, 19, 20, 29, 1, 7, 41, 40, 47, 50, 59, 61, 67, 71, 70, 79, 80, 89, 97, 131, 130, 137, 139, 110, 127, 101, 107, 109, 149, 151, 157, 160, 167, 170, 179, 181, 191, 190, 197, 199, 211, 220, 227, 229, 200, 209, 241, 251, 257, 260, 269

Offset

1,1

Links

Vincenzo Librandi, Table of n, a(n) for n = 1..1000

Mathematica

FromDigits[IntegerDigits[#]/.{3->p, 0->q}/.{p->0, q->3}]&/@Prime[Range[100]] (* Vincenzo Librandi, Mar 11 2013 *)

Prog

(PARI) a(n)=my(v=[3, 1, 2, 0, 4, 5, 6, 7, 8, 9]); apply(k->v[k+1], digits(prime(n))) \\ Charles R Greathouse IV, Jul 16 2013

Crossrefs

Sequence in context: A078049 A021490 A084258 * A321205 A111352 A173343

Adjacent sequences: A171013 A171014 A171015 * A171017 A171018 A171019

Keyword

nonn,base,easy

Author

N. J. A. Sloane and Vincenzo Librandi, Sep 04 2010

Status

approved