|
| |
|
|
A171055
|
|
In the sequence of prime numbers, replace all the '9' digits with '6' and vice versa.
|
|
4
|
|
|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
LINKS
|
|
|
|
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
|
|
|
|
KEYWORD
|
nonn,base,easy
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
