24895

Appears in sequences

• Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 27 ones.at n=12A031795
• Ruth-Aaron numbers (2): sum of prime divisors of n = sum of prime divisors of n+1 (both taken with multiplicity).at n=27A039752
• Numbers k such that sopf(k) = sopfr(k+1), where sopf(k) = A008472(k) and sopfr(k) = A001414(k).at n=29A064678
• Numbers n such that the sum of the digits of the n-th Fibonacci number written in bases 2, 3, 5 and 7 is prime.at n=31A111064
• Number of partitions of n such that the number of parts and the greatest part are not coprime.at n=42A200792
• Let sequence B_n={b_m} be defined by: b_1=prime(n), b_2=prime(n+1); for m>=3, b_m=b_(m-2)+b_(m-1) if b_(m-2)+b_(m-1) is not semiprime, otherwise b_m is the least prime divisor of b_(m-2)+b_(m-1). Then a(n) is the maximal term of sequence B_n, or a(n)=0 if B_n is unbounded.at n=75A221218
• Read (exponents of primes in the factorization of n!) modulo 2 and convert to decimal.at n=50A240504