|
|
A171015
|
|
In the sequence of prime numbers, replace all the '2' digits with '1' and vice versa.
|
|
3
|
|
|
1, 3, 5, 7, 22, 23, 27, 29, 13, 19, 32, 37, 42, 43, 47, 53, 59, 62, 67, 72, 73, 79, 83, 89, 97, 202, 203, 207, 209, 223, 217, 232, 237, 239, 249, 252, 257, 263, 267, 273, 279, 282, 292, 293, 297, 299, 122, 113, 117, 119, 133, 139, 142, 152, 157, 163
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
MATHEMATICA
|
FromDigits[IntegerDigits[#]/.{2->p, 1->q}/.{p->1, q->2}]&/@Prime[Range[100]] (* Vincenzo Librandi, Mar 12 2013 *)
|
|
PROG
|
(PARI) a(n)=my(v=[0, 2, 1, 3, 4, 5, 6, 7, 8, 9]); subst(Pol(apply(k->v[k+1], digits(prime(n)))), 'x, 10) \\ Charles R Greathouse IV, Jul 16 2013
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|