375129

Appears in sequences

• Consider the version of the Collatz or 3x+1 problem where x -> x/2 if x is even, x -> (3x+1)/2 if x is odd. Define the stopping time of x to be the number of steps needed to reach 1. Sequence gives the number of integers x with stopping time n.at n=46A060322
• Positive integers k such that (k+1)^4 has a divisor congruent to -1 modulo k.at n=56A350916
• a(0) = 9, a(1) = 9, and a(n) = 3*a(n-1) - a(n-2) - 4 for n >= 2.at n=13A350919