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

2, 3, 5, 7, 99, 93, 97, 91, 23, 21, 39, 37, 49, 43, 47, 53, 51, 69, 67, 79, 73, 71, 83, 81, 17, 909, 903, 907, 901, 993, 927, 939, 937, 931, 941, 959, 957, 963, 967, 973, 971, 989, 919, 913, 917, 911, 299, 223, 227, 221, 233, 231, 249, 259, 257, 263

Offset

1,1

Links

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

Mathematica

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

Prog

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

Crossrefs

Sequence in context: A289755 A318202 A076406 * A092909 A080437 A092908

Adjacent sequences: A171047 A171048 A171049 * A171051 A171052 A171053

Keyword

nonn,base,easy

Author

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

Status

approved