This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A360529 #117 May 19 2023 04:24:27
%S A360529 12,20,18,28,45,24,40,63,44,36,52,56,60,99,68,175,48,76,117,50,84,88,
%T A360529 75,92,54,80,153,104,72,275,98,171,116,90,124,147,325,132,136,207,140,
%U A360529 96,148,135,152,539,156,100,164,126,425,172,261,176,120,637,184,279,188,475,108,112,297,160,204,208
%N A360529 a(n) is the smallest k > A024619(n) such that rad(k) = rad(A024619(n)), where rad(n) = A007947(n).
%C A360529 Permutation of A126706.
%C A360529 Let m = A024619(n) and let R_m be the sequence of numbers k such that rad(k) = rad(m). a(n) gives the successor to m in R_m.
%H A360529 Michael De Vlieger, <a href="/A360529/b360529.txt">Table of n, a(n) for n = 1..10000</a>
%H A360529 Michael De Vlieger, <a href="/A360529/a360529.png">Log log scatterplot of a(n)</a>, n = 1..2^16.
%F A360529 a(n) = A065642 \ A001597.
%F A360529 Squarefree m implies a(n) = lpf(m)*m = A020639(m)*m.
%e A360529 A024619(1) = 6; the smallest k > 6 such that rad(k) = 6 is a(1) = 12.
%e A360529 A024619(2) = 10; the smallest k > 10 such that rad(k) = 10 is a(2) = 20.
%e A360529 A024619(3) = 12; the smallest k > 12 such that rad(k) = rad(12) = 6 is a(3) = 18.
%t A360529 rad[x_] := rad[x] = Times@ FactorInteger[x][[All, 1]]; Table[k = m + 1; Function[r, If[SquareFreeQ[m], m*FactorInteger[m][[1, 1]], While[rad[k] != r, k++]; k]][rad[m]], {m, Select[Range[2, 104], ! PrimePowerQ[#] &]}]
%Y A360529 Cf. A001597, A007947, A020639, A024619, A065642, A360719.
%K A360529 nonn
%O A360529 1,1
%A A360529 _Michael De Vlieger_, May 01 2023