cp's OEIS Frontend

A336389 The least positive integer k for which A336835(k) >= n, where A336835(k) is the number of iterations of x -> A003961(x) needed before the result is deficient (sigma(x) < 2x), when starting from x=k.

%I A336389 #66 Aug 31 2020 19:52:06
%S A336389 1,6,120,19399380,195534950863140268380,
%T A336389 538938984694949877040715541221415046162838700,
%U A336389 216487559804430601784907786655491617909711008142914104790481010259258659171900
%N A336389 The least positive integer k for which A336835(k) >= n, where A336835(k) is the number of iterations of x -> A003961(x) needed before the result is deficient (sigma(x) < 2x), when starting from x=k.
%C A336389 For n > 0, the least k such that for at least n-1 iterations of map x -> A003961(x), starting from x=k, x stays nondeficient. In other words, from each a(n) starts a chain of at least n nondeficient numbers (A023196) obtained by successive prime shifts, e.g, for a(3) we have: 19399380 -> 334639305 -> 5391411025, where -> stands for applying A003961, the prime shift towards larger primes.
%C A336389 After 1 all other terms here are even, because if an odd number k is nondeficient, then A064989(k) is nondeficient also, where A064989 is the prime shift towards smaller primes. Moreover, because A047802 is defined for every n >= 0, also this sequence is.
%C A336389 From _Peter Munn_, Aug 13 2020 (Start)
%C A336389 Upper bounds for a(4) and a(5) are:
%C A336389 a(4) <= 195534950863140268380 = A064989(A064989(A064989(20169691981106018776756331))) = A337202(3).
%C A336389 a(5) <= 538938984694949877040715541221415046162838700 = A064989^4((A047802(4)*17*19)/137).
%C A336389 (End)
%C A336389 From _David A. Corneth_, Aug 21 2020: (Start)
%C A336389 Subsequence of A025487.
%C A336389 Let prime(n)# be the n-th primorial number, A002110(n) = A034386(prime(n)). Then:
%C A336389 a(6) <= 191# * 7#;
%C A336389 a(7) <= 311# * 5#;
%C A336389 a(8) <= 457# * 5#.
%C A336389 (End)
%C A336389 That each term occurs in A025487 follows because (1), the abundancy index of prime(i)^e is larger than that of prime(i+1)^e, that is, sigma(prime(i)^e)/prime(i)^e > sigma(prime(i+1)^e)/prime(i+1)^e, and (2) because the abundancy index of p^(e+d) * q^e is larger than that of p^e * q^(e+d), where p and q are distinct primes, p < q, and e, d > 0. Thus, for any n, we can first find a "prime-factorization compressed version" of it, A071364(n), and then sort the exponents to the non-ascending order with A046523 (and actually, A046523(A071364(n)) = A046523(n), so we need to apply just A046523), to get a term x of A025487, that certainly have the abundancy index >= n [and this inequivalence stays same for their successive prime shifts as well, the abundancy index of A003961(x) being at least that of A003961(n), etc.], and as A046523(n) <= n for all n, it is guaranteed that the least k for which A336835(k) >= n are found from A025487, which is the range of A046523.
%H A336389 <a href="/index/Pri#prime_indices">Index entries for sequences computed from indices in prime factorization</a>
%H A336389 <a href="/index/Si#SIGMAN">Index entries for sequences related to sigma(n)</a>
%F A336389 For n >= 0, A336835(a(n)) >= n.
%F A336389 For all n >= 1, a(n) <= A337202(n-1) [= 2*A246277(A047802(n-1))].
%F A336389 a(n) = A025487(A337477(n)).
%F A336389 a(n) = A108951(A337478(n)).
%o A336389 (PARI)
%o A336389 A003961(n) = my(f = factor(n)); for (i=1, #f~, f[i, 1] = nextprime(f[i, 1]+1)); factorback(f); \\ From A003961
%o A336389 A336835(n) = { my(i=0); while(sigma(n) >= (n+n), i++; n = A003961(n)); (i); };
%o A336389 A336389(n) = for(i=1,oo,if(A336835(i)>=n,return(i)));
%Y A336389 Cf. A003961, A005100, A023196, A025487, A047802, A108951, A246277, A329900, A336834, A336835, A337202, A337205, A337477, A337478.
%Y A336389 From term a(2) = 120 onward a subsequence of A337386.
%K A336389 nonn,hard,more
%O A336389 0,2
%A A336389 _Antti Karttunen_, Aug 07 2020
%E A336389 a(4) - a(6) from combined work of _David A. Corneth_ and _Peter Munn_ Aug 13-26 2020