Timeline for Is there a name for sequences of integers reduced to their lowest prime divisors?
Current License: CC BY-SA 3.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Apr 19, 2018 at 1:02 | comment | added | José Hdz. Stgo. | You could refer to it by its OEIS id: oeis.org/A020639 | |
| Apr 19, 2018 at 0:38 | history | edited | Gerry Myerson | CC BY-SA 3.0 |
deleted improper apostrophe
|
| Apr 18, 2018 at 17:01 | comment | added | LSpice | Except using the variable name $m$ as part of the acronym (as in LPFM for "least prime factor dividing $m$") tweaks at least my sense of æsthetics in an unpleasant way …. | |
| Apr 18, 2018 at 16:17 | history | edited | Brad Graham | CC BY-SA 3.0 |
fixed index
|
| Apr 18, 2018 at 16:12 | comment | added | Brad Graham | "LPF sequence" could work... | |
| Apr 18, 2018 at 15:57 | comment | added | Gerhard Paseman | I recommend an acronym to represent the key property. Since it appears you are using the smallest primes, you have an LPF representation, where the member of the sequence corresponding to n is LeastPrimeFactor(n). You can modify this given a base m to change smallest set to set of primes dividing m, and then use LPFM(n) or something similar. If you define it carefully and clearly, using acronyms should not detract much from the presentation. Gerhard "FWIW YMMV IMHO IANAL TISMFISDIMO" Paseman, 2018.04.18. | |
| Apr 18, 2018 at 15:46 | history | asked | Brad Graham | CC BY-SA 3.0 |