58695

Appears in sequences

• a(n) = (n-1)*(2*n-1)*(3*n-1).at n=22A033594
• Odd numbers with exactly 5 distinct prime factors.at n=29A046391
• Numbers k such that both k and k+1 are abundant.at n=12A096399
• Numbers k such that both sigma(k) >= 2*k-1 and sigma(k+1) >= 2*(k+1)-1.at n=14A103289
• Odd squarefree abundant numbers.at n=21A112643
• Odd unitary abundant numbers.at n=21A129485
• Products of 5 distinct primes a,b,c,d,e, such that a+b+c+d+e are prime numbers.at n=7A178782
• First occurrence of n in A225399, or -1 if n does not appear in A225399.at n=36A225400
• Primitive, odd, squarefree abundant numbers.at n=21A249263
• Numbers n with property that A062234(n) = A062234(n+1) = A062234(n+2) = A062234(n+3).at n=20A257892
• 8-Modular Catalan Numbers C_{n,8}.at n=11A261591
• Numbers n such that n and n+1 both have 32 divisors.at n=1A274807
• Numbers n that enter a cycle of greater length than that for any k < n in the iteration sequence s(0)=n, s(k+1) = s(k) + (-1)^k*d(s(k)), where d(n) is the number of divisors of n (A000005).at n=5A285004
• Let d(n,k) be the n-th divisor of a number k. a(n) is the smallest k such that d(n+1,k+1) = d(n,k) + 1.at n=11A285883
• a(n) is the least number that enters a cycle of length 2n in the iteration sequence s(0)=n, s(k+1) = s(k) + (-1)^k*d(s(k)), where d(n) is the number of divisors of n (A000005).at n=6A288070
• Squarefree primitive abundant numbers (first definition: having only deficient proper divisors).at n=41A298973
• Numbers k such that both k and k+1 are bi-unitary abundant numbers.at n=4A318167
• Numbers k such that k and k+1 have at least 4 but not both exactly 4 distinct prime factors.at n=4A321494
• Numbers k such that both k and k+1 are infinitary abundant numbers (A129656).at n=3A327635
• Numbers k such that both k and k+1 are Zumkeller numbers (A083207).at n=10A328327