121275

Appears in sequences

• Highly composite odd numbers: odd numbers where d(n) increases to a record.at n=16A053624
• Triangle of signed numbers used for the computation of the column sequences of triangle A090217.at n=12A090435
• Numbers k such that 2*k+1, 4*k+1, 8*k+1, 16*k+1 and 32*k+1 are primes.at n=17A124413
• Increment each prime factor for each term of the least prime sequence A087443.at n=40A131801
• Increment each prime factor for each term of the least prime signature sequence derived from A080577.at n=41A131822
• Numbers with exactly 4 distinct odd prime divisors {3,5,7,11}.at n=20A147577
• Least term of A004767 with exactly 2n divisors.at n=26A204086
• Least positive integer k with exactly n odd divisors greater than sqrt(2*k).at n=25A281008
• Odd bisection of A283983; square root of the largest square dividing A277324.at n=46A283484
• Odd bisection of A283983; square root of the largest square dividing A277324.at n=58A283484
• Triangle T(n,k) read by rows: coefficients of polynomials P_n(t) defined in Formula section.at n=34A286782
• Column 5 of A286782.at n=2A287035
• Triangle read by rows: T(n,k) = number of partitions of genus 2 of n elements with k parts (n >= 6, 2 <= k <= n-4).at n=18A297178
• a(n) is the least number with exactly n odd divisors that are <= sqrt(n).at n=26A334853
• Numbers that are not practical (A237287) and have more divisors than any smaller number that is not practical.at n=15A335029
• Primorial inflation of n prime shifted once: a(n) = A003961(A108951(n)).at n=34A337471
• Smallest number having exactly n divisors of the form 8*k + 1.at n=14A343104
• Smallest number having exactly n divisors of the form 8*k + 3.at n=15A343105
• a(n) is the least number with exactly n divisors of the form 4*k+1.at n=26A364584
• a(n) is the least number with exactly n divisors of the form 4*k+3.at n=27A364585