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.
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
Offset: 1
Keywords
Examples
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.
Links
- Scott R. Shannon, Table of n, a(n) for n = 1..10000
- Michael De Vlieger, Log log scatterplot of a(n), n = 1..2^20, showing primes in red, composites in dark blue.
- 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.
- Scott R. Shannon, Image of the first 100000 terms. The green line is a(n) = n.
Programs
-
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}]; Array[a, nn] (* Michael De Vlieger, Nov 28 2023 *)
Comments