48511

Appears in sequences

• Semiprimes in A054567.at n=35A113692
• Numbers to which Mersenne primes 2^p-1 can be congruent mod k! (for k > 1).at n=13A145038
• Numbers n such that sopfr(n) = sopfr(n-1) + sopfr(n-2), where sopfr is the sum of prime factors of n with multiplicity (A001414).at n=11A294995
• Number of regions among all distinct circles that can be constructed from n equally spaced points along a line using only a compass.at n=20A359253