Reminder: The OEIS is hiring a new managing editor, and the application deadline is January 26.
%I #70 Nov 19 2023 10:33:30
%S 1,2,3,5,4,8,5,11,18,6,14,15,26,7,18,20,36,8,23,44,25,68,26,49,9,29,
%T 58,31,96,32,65,10,35,76,38,131,39,83,84,11,88,42,156,43,97,45,174,46,
%U 104,106,12,111,50,283,206,51,121,53,228,54,130,133,13,138,58
%N a(n) = number of k <= m such that rad(k) | m, where m = A025487(n) and rad(n) = A007947(n).
%C Not a permutation of natural numbers: a(4) = a(7) = 5.
%C Let S_rad(m) be the sequence { k : rad(k) | rad(m) }. This sequence gives the number of k <= rad(m). Seen another way, this sequence gives the position of m in S_rad(m).
%C The number m appears after its factors in S_rad(m). If k < sqrt(m) then k^2 also appears before m.
%C Scatterplot exhibits trajectories according to t = omega(m) = A001221(A025487(n)). The first term in each trajectory is A002110(t).
%H Michael De Vlieger, <a href="/A364225/b364225.txt">Table of n, a(n) for n = 1..1809</a> (all terms a(n) <= A002110(10))
%H Michael De Vlieger, <a href="/A364225/a364225.png">Log log scatterplot of a(n)</a>, n = 1..1809, accentuating primorial A025487(n) in red, noting a(n) above in black, and labeling n in blue italic below for the first 24 terms.
%F a(n) = A010846(A025487(n)).
%e a(1) = 1 since 1 is the only number k that does not exceed 1 such that rad(k) | 1.
%e a(2) = 2 since k in {1, 2} are such that rad(k) | 2.
%e a(3) = 3 since k in {1, 2, 4} are such that rad(k) | 4.
%e a(4) = 5 since k in {1, 2, 3, 4, 6} are such that rad(k) | 6, etc.
%t rad[x_] := Times @@ FactorInteger[#][[All, 1]];
%t Map[Function[{n, r},
%t Count[Range[n], _?(Divisible[r, rad[#]] &)]] @@ {#, rad[#]} &,
%t {1}~Join~Select[Range[Times @@ Prime@ Range[6]],
%t # == Transpose@ {Prime@ Range[Length[#]], ReverseSort[#[[All, -1]] ]} &@
%t FactorInteger[#] &] ]
%Y Cf. A001221, A002110, A007947, A010846, A025487, A363061.
%K nonn
%O 1,2
%A _Michael De Vlieger_, Oct 24 2023