147773

Properties

Appears in sequences

• Smallest number requiring n steps to reach 0 when iterating the function: f(n)=abs(lpd(n)-Lpf(n)), where lpd(n) is the largest proper divisor of n and Lpf(n) is the largest prime factor of n.at n=16A074347
• Smallest number k such that M(n)^2+k*M(n)-1 is prime with M(n)= Mersenne primes =A000668(n).at n=26A139426
• Smallest prime p such that M(n)^2+p*M(n)-1 is prime with M(n)= Mersenne primes =A000668(n).at n=26A139430
• Duplicate of A139426.at n=26A143384
• Duplicate of A139430.at n=26A143386
• Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-2) + 2n, where a(0) = 1, a(1) = 2, b(0) = 3.at n=20A294538
• a(n+2) is the smallest odd prime such that a(n) is the smallest odd prime divisor of a(n+1)+a(n+2), starting with a(1) = 11 and a(2) = 19.at n=9A352955
• Prime numbersat n=13659