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

2, 3, 5, 7, 11, 13, 17, 10, 23, 20, 31, 37, 41, 43, 47, 53, 50, 61, 67, 71, 73, 70, 83, 80, 7, 191, 193, 197, 190, 113, 127, 131, 137, 130, 140, 151, 157, 163, 167, 173, 170, 181, 101, 103, 107, 100, 211, 223, 227, 220, 233, 230, 241, 251, 257, 263

Offset

1,1

Links

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

Mathematica

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

Prog

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

Crossrefs

Sequence in context: A308505 A338938 A249823 * A171053 A171055 A117285

Adjacent sequences: A171046 A171047 A171048 * A171050 A171051 A171052

Keyword

nonn,base,easy

Author

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

Status

approved