|
| |
|
|
A367711
|
|
a(1) = 2; for n > 2, a(n) is the smallest positive number that has not yet appeared that has a common factor k > 1 with A001414(a(n-1)), the sum of the primes dividing a(n-1), with repetition.
|
|
1
|
|
|
|
2, 4, 6, 5, 10, 7, 14, 3, 9, 8, 12, 21, 15, 16, 18, 20, 24, 27, 30, 22, 13, 26, 25, 28, 11, 33, 32, 34, 19, 38, 35, 36, 40, 44, 39, 42, 45, 55, 46, 50, 48, 66, 52, 17, 51, 54, 77, 56, 65, 57, 58, 31, 62, 60, 63, 78, 64, 68, 49, 70, 72, 69, 74, 75, 91, 76, 23, 92, 81, 80, 104, 95, 82, 43, 86
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
In the first 100000 terms the only fixed point is 9, and it is likely no more exist. In the same range the smallest missing numbers are 4073, 5039, 5261. The sequence is conjectured to be a permutation of the integers >= 2.
In scatterplot, composites fall in a cototient trajectory just above the line a(n)/n, while primes fall into several trajectories well below the line a(n)/n. This is an effect of finding the next term a(n) such that gcd(a(n), a(n-1)) = 1.
The trajectories T of primes a(n) arrange according to a(n+1)/a(n) = m. Hence, for example, T(m), m = 2 includes {2, 5, 7, 13, 19, 31, 43, ...}, T(3) includes {3, 11, 17} and may be finite, T(4) includes {23, 41, 47, 71, 83, 101, ...}, but T(m) for m in {5, 16, 17, ...} does not appear in the first 2^20 terms. It is evident that the trajectories T(m) are nonlinear.
The smallest missing number in a(1..1048576) is prime(3912) = 36899, followed by primes with indices 3995, 4151, 4179, etc. The smallest missing composite is 1116967. (End)
|
|
|
LINKS
|
Michael De Vlieger, Log log scatterplot of a(n), n = 1..2^14, showing primes in red, composite prime powers in gold, squarefree composites in green, numbers neither squarefree nor prime powers in blue, accentuating numbers of the last category that are also squareful in light blue.
|
|
|
EXAMPLE
|
a(10) = 8 as a(9) = 9 and A001414(9) = 6, and 8 is the smallest unused number that shares a factor with 6. This is the first term to differ from A365060.
|
|
|
MATHEMATICA
|
nn = 120; c[_] := False;
f[x_] := f[x] = Total[Times @@@ FactorInteger[x]]; f[1] = 1;
a[1] = j = 2; c[2] = True; u = 3;
Do[k = u; While[Or[c[k], CoprimeQ[j, k]], k++];
Set[{a[n], c[k], j}, {k, True, f[k]}];
If[k == u, While[c[u], u++]], {n, 2, nn}];
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
