24561

Appears in sequences

• a(n) is the number of integers m which take n steps to reach 1 in '3x+1' problem.at n=45A005186
• Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 82 ones.at n=31A031850
• Multiplicity of highest weight (or singular) vectors associated with character chi_95 of Monster module.at n=40A034483
• a(n) = 3*2^n - n - 2.at n=13A079583
• First differences of A213709.at n=18A226060
• a(n) = a(n-1) + 3*a(n-2) -2*a(n-3) - 2*a(n-4), where a(0) = 0, a(1) = 0, a(2) = -1, a(3) = 1.at n=24A295725
• a(n) gives the length of A306211 after n generations.at n=21A306215
• High water marks for number of primes between prime(n)^2 and prime(n+1)^2.at n=41A380135
• Consecutive states of the linear congruential pseudo-random number generator 259*s mod 2^15 when started at s=1.at n=12A384194
• Numbers k such that sigma(k) = psi(k) + tau(k) + pi(k).at n=5A389855