login
A398794
Number of values 0 <= r < 2^n such that the trajectories of r and r+1 under the 5x+1 map f (A185452), satisfy f^(n)(r) = f^(n)(r+1) and contain the same number of odd terms among the first n iterates.
3
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 3, 11, 28, 70, 161, 370, 835, 1840, 4021, 8621, 18401, 38859, 81609, 170522, 354345, 734214, 1514485, 3116549
OFFSET
1,12
COMMENTS
The analog of A398792 for the 5x+1 map (A185452). No convergence assumption is involved: merging at the same step index with equal odd count is a finite event decided by the residue class (Terras's parity argument is valid for every map (q*x+1)/2 with q odd), so the count is well defined even though 5x+1 trajectories are believed to diverge.
The density a(n)/2^n at n = 22 is 0.0044, against 0.409 for the Collatz map (A398792) and 0.107 for 7x+1 (A398795). On a step where both members of a pair have the same parity the difference is multiplied by 1/2 (both even) or by q/2 (both odd), so the expected multiplier is (1+q)/4; this equals 1 only for q = 3, and is larger than 1 for q >= 5. The densities observed for q >= 5 are much smaller than for q = 3, but they are nondecreasing in n and they are not ordered by q: q = 7 gives a larger density than q = 5.
Relation to the 3x+1 problem: comparing this count with A398792 and A398795 singles out q = 3 as the only map in the family (q*x+1)/2 for which the difference of a consecutive pair neither grows nor shrinks on average, one precise sense in which the Collatz map is the borderline case of its family.
EXAMPLE
a(11) = 1: the residue r = 909 is the unique class merging within 11 steps, and n = 11 is the smallest level at which any class merges.
PROG
(Python)
def a(n):
c = 0
for r in range(2**n):
x, y, sx, sy = r, r+1, 0, 0
for _ in range(n):
sx += x & 1; sy += y & 1
x = (5*x+1)//2 if x & 1 else x//2
y = (5*y+1)//2 if y & 1 else y//2
if x == y:
c += sx == sy
break
return c
CROSSREFS
KEYWORD
nonn,more,new
AUTHOR
Omar Said, Aug 09 2026
EXTENSIONS
a(23)-a(29) from Sean A. Irvine, Aug 23 2026
STATUS
approved