A362855 a(n) = n for n <= 3; for n > 3, a(n) is the least novel multiple of k, the product of all distinct prime factors of a(n-2) that do not divide a(n-1).
1, 2, 3, 4, 6, 5, 12, 10, 9, 20, 15, 8, 30, 7, 60, 14, 45, 28, 75, 42, 25, 84, 35, 18, 70, 21, 40, 63, 50, 105, 16, 210, 11, 420, 22, 315, 44, 525, 66, 140, 33, 280, 99, 350, 132, 175, 198, 245, 264, 385, 24, 770, 27, 1540, 36, 1155, 26, 2310, 13, 4620, 39, 3080, 78, 1925, 156, 2695, 234, 3465, 52, 5775
Offset: 1
Keywords
Examples
From _Michael De Vlieger_, Apr 23 2024: (Start)
Let rad(x) = A007947(x) and let P(x) = A002110(x).
Let S = { prime p : p | a(n-2) } and let T = { prime p : p | a(n-1) }. Then k = Product_{p in S\T} p = rad(a(n-2)*a(n-1))/rad(a(n-1)).
a(3) = 3 since rad(1*2)/rad(2) = 1; a(1) = 1, a(2) = 2, therefore a(3) = 3*1.
a(4) = 4 since rad(2*3)/rad(3) = 2; a(2) = 2, thus a(4) = 2*2.
a(5) = 6 since rad(3*4)/rad(4) = 6/2 = 3; a(3) = 3, thus a(5) = 2*3.
a(91305) = 108 and a(91306) = P(17), therefore k = 1 since rad(108) | P(17). The smallest missing number is 53, therefore a(91307) = 53*1. Related sequence A368133 = b is such that it is coincident with this sequence until b(91307) = 61, since prime(18) = 61 is the smallest prime that does not divide b(91306) = P(17). (End)
Links
- Michael De Vlieger, Table of n, a(n) for n = 1..10000
- Michael De Vlieger, Log log scatterplot of a(n), n = 1..701, showing primes in red, composite prime powers in gold, squarefree composites in green, and numbers neither squarefree nor prime powers in blue. Powerful numbers are labeled in gold (if a prime power) or blue. Primorials P(i) = A002110(i) are labeled in green.
- Michael De Vlieger, Log log scatterplot of a(n) for n = 1..2^20.
- Michael De Vlieger, Plot of k = pi(p) | a(n) at (x, y) = (n, k), n = 1..4581, with a color function representing multiplicity where black indicates 1, red = 2, etc. The bar of color at the bottom indicates primes in red, composite prime powers in gold, composite squarefree in green, and other numbers in blue.
- Michael De Vlieger, Divisibility Based Lexically Earliest Sequence with Cellular Automaton Behavior, ResearchGate, 2024.
Programs
-
Mathematica
nn = 100; c[] := False; m[] := 1; f[x_] := f[x] = Times @@ FactorInteger[x][[All, 1]]; Array[Set[{a[#], c[#], m[#]}, {#, True, 2}] &, 2]; i = 1; j = r = 2; Do[(While[c[Set[k, # m[#]]], m[#]++]) &[r/f[j]]; Set[{a[n], c[k], i, j, r}, {k, True, j, k, f[j*k]}], {n, 3, nn}]; Array[a, nn] (* Michael De Vlieger, Feb 21 2024 *)
Comments