cp's OEIS Frontend

A383361 a(n) is the i-th smallest divisor d_i of A383360(n) for which i*d_i = A383360(n).

%I A383361 #5 May 08 2025 18:08:27
%S A383361 1,2,5,5,7,9,7,6,8,11,13,8,11,8,17,13,19,17,23,19,12,29,23,31,37,16,
%T A383361 29,41,31,43,47,16,37,53,20,41,43,35,59,61,47,25,67,21,53,71,73,28,59,
%U A383361 79,20,61,49,83,89,67,27,55,28,71,97,73,101,103,79,107,65,109
%N A383361 a(n) is the i-th smallest divisor d_i of A383360(n) for which i*d_i = A383360(n).
%H A383361 Felix Huber, <a href="/A383361/b383361.txt">Table of n, a(n) for n = 1..10000</a>
%F A383361 a(n) = A383360(n)/A383362(n).
%F A383361 a(n) = A027750(A383360(n),A383362(n)).
%e A383361 a(8) = 6 because 6 is the 5th smallest divisor of A383360(8) = 30 = 5*6.
%p A383361 with(NumberTheory):
%p A383361 A383360:=proc(n)
%p A383361     option remember;
%p A383361     local k,i,L;
%p A383361     if n=1 then
%p A383361         1
%p A383361     else
%p A383361         for k from procname(n-1)+1 do
%p A383361             L:=Divisors(k);
%p A383361             for i to tau(k) do
%p A383361                 if L[i]*i=k then
%p A383361                     return k
%p A383361                 fi
%p A383361             od
%p A383361         od
%p A383361     fi;
%p A383361 end proc;
%p A383361 A383361:=proc(n)
%p A383361     local i,M;
%p A383361     M:=Divisors(A383360(n));
%p A383361     for i do
%p A383361         if A383360(n)/i=M[i] then
%p A383361             return M[i]
%p A383361         fi
%p A383361     od;
%p A383361 end proc;
%p A383361 seq(A383361(n),n=1..68);
%Y A383361 Cf. A383360, A383362.
%K A383361 nonn,easy
%O A383361 1,2
%A A383361 _Felix Huber_, May 03 2025