25777

Appears in sequences

• Smallest multiple of n-th prime which is == 1 mod (n+1)-st prime.at n=39A073603
• Numbers n such that h(n) = 3 h(n-1) where h(n) is the length of the sequence {n, f(n), f(f(n)), ...., 1} in the Collatz (or 3x + 1) problem. (The earliest "1" is meant.)at n=29A078420
• Number of (n+1)X(1+1) 0..2 arrays with the maximum plus the lower median minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=4A237958
• Number of (n+1)X(5+1) 0..2 arrays with the maximum plus the lower median minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=0A237962
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the lower median minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=10A237965
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the lower median minus the minimum of every 2X2 subblock differing from its horizontal and vertical neighbors by exactly one.at n=14A237965
• Semiprimes whose prime factors are of equal binary length and which differ from each other in exactly three bit positions.at n=45A261075
• Sequence of pairwise relatively prime numbers of class P_8 (see comment in A275246).at n=18A275253