|
|
A171051
|
|
In the sequence of prime numbers, replace all the '9' digits with '2' and vice versa.
|
|
3
|
|
|
9, 3, 5, 7, 11, 13, 17, 12, 93, 92, 31, 37, 41, 43, 47, 53, 52, 61, 67, 71, 73, 72, 83, 82, 27, 101, 103, 107, 102, 113, 197, 131, 137, 132, 142, 151, 157, 163, 167, 173, 172, 181, 121, 123, 127, 122, 911, 993, 997, 992, 933, 932, 941, 951, 957, 963
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
MATHEMATICA
|
FromDigits[IntegerDigits[#] /. {9 -> p, 2 -> q} /. {p -> 2, q -> 9}] & /@ Prime[Range[100]] (* Harvey P. Dale, Apr 11 2012 *)
|
|
PROG
|
(PARI) a(n)=my(v=[0, 1, 9, 3, 4, 5, 6, 7, 8, 2]); 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
|
|
|
|