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”).
%I #14 Mar 14 2020 17:22:59
%S 12900,737100,772176,832050,844032,844992,864976,872208,879984,887088,
%T 926400,939900,954828,960372,962724,964800,967500,969444,972804,
%U 973296,975828,976144,980000,982044,984064
%N n, ps(n), ps^2(n), ..., ps^9(n) forms an increasing ps-sequence of length 10,
%C ps (read phi-sigma) is the consecution of the sigma (sum of divisors) and Euler totient function.
%C The problem raises from the aliquot sequences. In the case of aliquot sequences we calculate the next element by calculating the sum of the divisors, and afterwards subtract the original number n.
%C Instead of subtract n we apply the totient function in order to get ps-sequences. Fast decreases can appear if the sum of divisors consist of many different small primes.
%C In fact ps-sequences end very fast in cycles, often cycles of small length.
%C I didn't find an increasing ps-sequence of length > 12.
%e 12900 = 2^2*3*5^2*43, s(12900) = 7*4*31*44, ps(12900) = 6*30*8*10 = 2^6*3^2*5^2 = 14400;
%e s(14400) = 127*13*31, ps(14400) = 126*12*30 = 2^4*3^4*5*7 = 45360; ...
%o (Sage) #(not fast!)
%o def phi(L):
%o m = 1
%o for l in L:
%o m = m * (l[0]-1)
%o for i in (1..l[1]-1):
%o m = m * l[0]
%o return m
%o def sigma(L):
%o m = 1
%o for l in L:
%o q = 1
%o for i in (0..l[1]):
%o q = q * l[0]
%o m = m * (q-1) / (l[0]-1)
%o return m
%o cc = 8
%o START = 2
%o END = 10000000
%o for f0 in (START..END):
%o c = 0
%o f = f0
%o Lf = list(factor(f))
%o s = sigma(Lf)
%o Ls = list(factor(s))
%o f1 = phi(Ls)
%o while f < f1:
%o c = c + 1
%o f = f1
%o Lf = list(factor(f))
%o s = sigma(Lf)
%o Ls = list(factor(s))
%o f1 = phi(Ls)
%o if c > cc:
%o print(c, ":", f0)
%K nonn
%O 1,1
%A _Matthijs Coster_, Mar 30 2009