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

2, 3, 5, 7, 11, 13, 17, 16, 23, 26, 31, 37, 41, 43, 47, 53, 56, 91, 97, 71, 73, 76, 83, 86, 67, 101, 103, 107, 106, 113, 127, 131, 137, 136, 146, 151, 157, 193, 197, 173, 176, 181, 161, 163, 167, 166, 211, 223, 227, 226, 233, 236, 241, 251, 257, 293

Offset

1,1

Links

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

Mathematica

FromDigits[IntegerDigits[#] /. {9 -> p, 6 -> q} /. {p -> 6, q -> 9}] & /@ Prime[Range[100]] (* Vincenzo Librandi, Jul 06 2012, after Harvey P. Dale in similar sequences *)

Prog

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

Crossrefs

Sequence in context: A249823 A171049 A171053 * A117285 A100546 A359373

Adjacent sequences: A171052 A171053 A171054 * A171056 A171057 A171058

Keyword

nonn,base,easy

Author

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

Status

approved