login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A365324
a(1) = 2, a(n) = k + 1, where k is the least number greater than a(n-1) such that rad(k) | a(n-1), where rad(n) = A007947(n).
1
2, 5, 26, 33, 82, 129, 244, 257, 66050, 78126, 78733, 79508, 81797, 271442, 524289, 531442, 551369, 571788, 580609, 707282, 1048577, 1419858, 1431645, 1476226, 1620897, 1712422, 2097153, 2146690, 2151297, 2505890, 2560001, 11082242, 16777217
OFFSET
1,1
FORMULA
a(n) = A289280(a(n-1)) + 1 for n > 1.
EXAMPLE
a(2) = 5 since the least k > a(1) such that rad(k) | a(1) is 4, and 4 + 1 = 5.
a(3) = 26 since the least k > a(2) such that rad(k) | a(2) is 25, and 25 + 1 = 26.
a(4) = 33 since the smallest k > 26 such that rad(k) | 26 is 32, and 32 + 1 = 33, etc.
MATHEMATICA
rad[x_] := rad[x] = Times @@ FactorInteger[x][[All, 1]];
NestList[(k = # + 1; While[! Divisible[#, rad[k]], k++]; k + 1) &, 2, 20]
CROSSREFS
KEYWORD
nonn,hard
AUTHOR
Michael De Vlieger, Nov 15 2023
STATUS
approved