|
|
A171052
|
|
In the sequence of prime numbers, replace all the '9' digits with '3' and vice versa.
|
|
3
|
|
|
2, 9, 5, 7, 11, 19, 17, 13, 29, 23, 91, 97, 41, 49, 47, 59, 53, 61, 67, 71, 79, 73, 89, 83, 37, 101, 109, 107, 103, 119, 127, 191, 197, 193, 143, 151, 157, 169, 167, 179, 173, 181, 131, 139, 137, 133, 211, 229, 227, 223, 299, 293, 241, 251, 257, 269
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
MATHEMATICA
|
FromDigits[IntegerDigits[#] /. {3 -> x, 9 -> y} /. {x -> 9, y -> 3}] & /@ Prime[Range[60]] (* Harvey P. Dale, Feb 23 2011 *)
|
|
PROG
|
(PARI) a(n)=my(v=[0, 1, 2, 9, 4, 5, 6, 7, 8, 3]); subst(Pol(apply(k->v[k+1], digits(prime(n)))), 'x, 10) \\ Charles R Greathouse IV, Jul 31 2013
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|