Timeline for Prime numbers from permutation
Current License: CC BY-SA 4.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 15, 2022 at 10:33 | comment | added | Thomas Sauvaget | When looking at the scatterplot of the sequence it is clear that there are subsequences on other lines. For instance I can numerically spot A131426 as one of the densest lines. | |
| Feb 15, 2022 at 8:09 | vote | accept | Notamathematician | ||
| Feb 14, 2022 at 17:34 | history | became hot network question | |||
| Feb 14, 2022 at 16:40 | answer | added | Ilya Bogdanov | timeline score: 9 | |
| Feb 14, 2022 at 15:05 | comment | added | Ilya Bogdanov | @Yaakov,: but it also seems to be provable... | |
| Feb 14, 2022 at 15:04 | comment | added | Notamathematician | @IlyaBogdanov, thank you for comment! Please share the details. | |
| Feb 14, 2022 at 14:43 | comment | added | Yaakov Baruch | At the OEIS page it seems that an open question is whether any integer can be kicked out to infinity. | |
| Feb 14, 2022 at 14:33 | comment | added | Ilya Bogdanov | Well, this is easy after you realize that $a(n)=2(n-1)$ iff the number $a(n)$ was shifted only to the left iff $a(n)-((k-2)\not\equiv 1\pmod k$ for all $k<a(n)/2$. Sorry, will fill out details later if necessary. | |
| Feb 14, 2022 at 10:13 | comment | added | Notamathematician | @YaakovBaruch, thank you for comment! Done. | |
| Feb 14, 2022 at 10:12 | history | edited | Notamathematician | CC BY-SA 4.0 |
added 241 characters in body
|
| Feb 14, 2022 at 9:47 | comment | added | Yaakov Baruch | I don't think "reverse-cyclically permuting every $n$ consecutive terms thereafter" is clear enough, not to me at least. Would you mind posting as an example, in a comment, $P(3)$ of $s(i)=i$? | |
| Feb 14, 2022 at 9:27 | history | asked | Notamathematician | CC BY-SA 4.0 |