82005

Appears in sequences

• a(n) = floor((3rd elementary symmetric function of 2,3,...,n+3)/(2+3+...+n+3)).at n=34A024178
• Sums of 5 distinct powers of 5.at n=34A038477
• a(n) = (11*n + 4)*C(n+3, 3)/4.at n=19A055268
• Numbers n such that the middle coefficient of the cyclotomic polynomial Phi_n(x) has a value not obtained for any smaller n.at n=36A095877
• Odd squarefree abundant numbers.at n=29A112643
• Odd unitary abundant numbers.at n=29A129485
• Number of hierarchical ordered partitions of partitions.at n=15A141199
• Numerator of Euler(n, 5/26).at n=4A157039
• Products of 5 distinct primes a,b,c,d,e, such that a+b+c+d+e are prime numbers.at n=16A178782
• Numbers n such that phi(n) = phi(n+7), with Euler's totient function phi = A000010.at n=36A179189
• Primitive, odd, squarefree abundant numbers.at n=29A249263
• Numbers whose base-4 and base-5 representations have only 0's and 1's.at n=8A263684
• Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 195", based on the 5-celled von Neumann neighborhood.at n=16A279751
• Numbers k such that {k + 2, k + 4} and {k^2 + 2, k^2 + 4} are both twin prime pairs.at n=35A284014
• Odd non-coreful abundant numbers: the odd terms of A308127.at n=30A339938
• Odd numbers k such that A360522(k) > 2*k.at n=29A360526
• Odd modified exponential abundant numbers: odd numbers k such that A241405(k) > 2*k.at n=29A379031