83265

Appears in sequences

• Numbers n such that 5*7^n + 2 is prime.at n=12A083351
• Odd numbers k such that abs(sigma(k)-2k) <= sqrt(k). Abundance-radius = abs(sigma(k)-2k) does not exceed square root of k and k is odd.at n=30A087415
• A sequence derived from pentagonal numbers, or a Stirling number of the first kind matrix.at n=29A094952
• Odd squarefree abundant numbers.at n=30A112643
• Primitive elements of A065607.at n=29A120692
• Odd unitary abundant numbers.at n=30A129485
• a(n) = (2*n+1)*(2*n+3)*(2*n+5)/3.at n=30A162540
• Products of 5 distinct primes a,b,c,d,e, such that a+b+c+d+e are prime numbers.at n=17A178782
• Primitive, odd, squarefree abundant numbers.at n=30A249263
• Minimum sum of a nonnegative integer triple that takes n moves to reach a 0 component, where a move picks two components, subtracts the smaller from the larger, and doubles the smaller.at n=21A256001
• a(n) = (n^2 - n + 1)*(n^2 + n - 1).at n=16A257925
• Numbers k such that k and k+1 have at least 4 but not both exactly 4 distinct prime factors.at n=16A321494
• Subsequence of A071395. The extra constraint is m is not a term if m*q/p is abundant where prime p|m and q is the least prime larger than p.at n=11A333967
• Odd unitary abundant numbers whose unitary abundancy is closer to 2 than that of any smaller odd unitary abundant number.at n=12A335052
• Odd bi-unitary abundant numbers whose bi-unitary abundancy is closer to 2 than that of any smaller odd bi-unitary abundant number.at n=4A335053
• Odd infinitary abundant numbers whose infinitary abundancy is closer to 2 than that of any smaller odd infinitary abundant number.at n=6A335055
• Odd non-coreful abundant numbers: the odd terms of A308127.at n=31A339938
• a(n) = Sum_{k=1..n} k^Omega(k).at n=21A347616
• Primitive nondeficient numbers satisfying a stronger condition that compares abundancy with related numbers as detailed in the comments.at n=30A352739
• Odd numbers k such that A360522(k) > 2*k.at n=30A360526