OFFSET
1,1
COMMENTS
All numbers p^p for primes p are in the sequence, as (p^p)' = p^p.
All known terms not of the form p^p differentiate to p^p after a finite number of steps, meaning all known cycles are of length 1. It is not known if this pattern continues for every term.
A099309 is a supersequence.
A348329, excluding 0 and 1, is a subsequence.
If n = 4*k for k > 1, then n' = 4'*k+4*k' = 4*(k+k') which is a larger multiple of 4. Hence any multiple of 4 that exceeds 4 (or multiple of p^p that exceeds p^p by identical logic) diverges to infinity under the map k -> k'.
The program provided assumes that all k that diverge to infinity become a multiple of 4 after a finite number of derivatives. If false the program will not halt for some n, but any outputted values will still be correct.
EXAMPLE
7251855' = 4425686
4425686' = 2238771
2238771' = 823543
823543' = 823543
Convergence to 823543 so 7251855 is in the sequence.
PROG
(Python)
def isok(n):
if n == 0:
return False
derivs = [n]
while True:
n = A003415(n)
if n in derivs:
return True
if n % 4 == 0:
return False
derivs.append(n)
CROSSREFS
KEYWORD
nonn
AUTHOR
Michael Adams, Dec 20 2025
EXTENSIONS
More terms from Sean A. Irvine, Jan 07 2026
STATUS
approved
