A348285 a(1) = 2; for n > 1, let a(k) be a divisor > 1 of n appearing in all previous terms where k is as large as possible. Then a(n) = n - k. If no such k exists then a(n) = n - m, where a(m) = 1 and m is as large as possible.
2, 1, 1, 3, 2, 1, 1, 3, 1, 5, 2, 1, 1, 3, 1, 5, 2, 1, 1, 3, 1, 5, 2, 1, 3, 3, 1, 5, 2, 1, 1, 3, 1, 5, 1, 4, 2, 1, 7, 3, 3, 1, 1, 7, 4, 9, 4, 1, 5, 1, 10, 5, 3, 1, 3, 9, 2, 1, 1, 3, 2, 1, 3, 3, 13, 2, 5, 2, 5, 1, 1, 4, 2, 1, 6, 3, 33, 2, 5, 1, 5, 4, 3, 1, 4, 8, 4, 1, 1, 7, 1, 5, 10, 16, 3, 1
Offset: 1
Keywords
Examples
a(2) = 1 as the last divisor > 1 of 2 so far appearing is a(1) = 2, and that is 2 - 1 = 1 term back from 2. a(3) = 1 as 3 is prime, thus the offset to the last 1 term, a(2), is 3 - 2 = 1. a(4) = 3 as the last divisor of 4 > 1 so far appearing is a(1) = 2, and that is 4 - 1 = 3 terms back from 4. a(6) = 1 as the last divisor of 6 > 1 so far appearing is a(5) = 2, and that is 6 - 5 = 1 term back from 6.
Links
- Scott R. Shannon, Image of the first 10^6 terms.
Comments