|
|
|
|
|
|
|
|
|
#149 by Yunhan Shi at Mon Mar 06 00:27:34 EST 2023
|
|
|
|
|
|
|
|
#148 by Yunhan Shi at Mon Mar 06 00:24:15 EST 2023
|
|
|
|
|
|
Discussion
|
| Mon Mar 06
| 00:27
| Yunhan Shi: this fixes rev148: https://oeis.org/history/view?seq=A002385&v=148
by adding (no replacement) the sorted array.
|
|
|
|
|
|
|
#146 by Yunhan Shi at Fri Mar 03 10:24:40 EST 2023
|
|
|
|
|
|
Discussion
|
| Fri Mar 03
| 10:55
| Michael S. Branicky: if it is not sorted, then it does not produce this sequence
|
|
| 10:55
| Michel Marcus: yes BUT you are not supposed to delete existing program
|
|
| 10:56
| Michel Marcus: and Mar 3 2023 should be Mar 03 2023
|
|
| 10:57
| Michel Marcus: and seeing Michael discussion; I guess it will be easier if I revert your edit
|
|
| 10:57
| Michel Marcus: you can come back again and ADD your program if you want
|
|
|
|
|
|
|
#145 by Yunhan Shi at Fri Mar 03 10:23:11 EST 2023
|
|
| PROG
|
A002385 = [11]+[*filter(isprime, (int(str(x) + str(x)[-2::-1]) for x in range(10**4)))] # Yunhan Shi, Mar 3 2023
|
|
|
|
|
Discussion
|
| Fri Mar 03
| 10:24
| Yunhan Shi: Hi all. I found a much shorter python code to generate the same sequence. (I didn't sort it)
|
|
|
|
|
|
|
#144 by Yunhan Shi at Fri Mar 03 10:21:19 EST 2023
|
|
| PROG
|
from itertools import chain
A002385 = sorted((n for n in chain((int(str(x)+str(x)[::-1]) for x in range(1, 10**5)), (int(str(x)+str(x)[-2::-1]) for x in range(1, 10**5))) if isprime(n))) # _Chai Wah Wu_, Aug 16 2014
|
|
| STATUS
|
approved
|
|
|
|
|
|
