|
|
A171034
|
|
In the sequence of prime numbers, replace all the '7' digits with '0' and vice versa.
|
|
3
|
|
|
2, 3, 5, 0, 11, 13, 10, 19, 23, 29, 31, 30, 41, 43, 40, 53, 59, 61, 60, 1, 3, 9, 83, 89, 90, 171, 173, 170, 179, 113, 120, 131, 130, 139, 149, 151, 150, 163, 160, 103, 109, 181, 191, 193, 190, 199, 211, 223, 220, 229, 233, 239, 241, 251, 250, 263, 269
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
LINKS
|
|
|
MATHEMATICA
|
FromDigits[IntegerDigits[#]/.{7->p, 0->q}/.{p->0, q->7}]&/@Prime[Range[100]] (* Vincenzo Librandi, Apr 07 2013 *)
|
|
PROG
|
(PARI) a(n)=my(v=[7, 1, 2, 3, 4, 5, 6, 0, 8, 9]); subst(Pol(apply(k->v[k+1], digits(prime(n)))), 'x, 10) \\ Charles R Greathouse IV, Jul 25 2013
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,base,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|