101475
domain: N
Appears in sequences
- Fibonacci sequence beginning 0, 15.at n=20A022349
- 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=33A087415
- Triangular numbers for which the number of divisors is also a triangular number.at n=29A116541
- Triangular numbers that are repdigits with length > 2 in some base.at n=30A274084
- Number of unlabeled rooted trees with n nodes in which all outdegrees are either 0, 1, or 3.at n=20A298204
- Triangular numbers that are binary palindromes.at n=18A350987
- Primitive nondeficient numbers satisfying a stronger condition that compares abundancy with related numbers as detailed in the comments.at n=34A352739
- Numbers k such that A360327(k) > 2*k.at n=12A360328
- Primitive terms of A360328: terms of A360328 with no proper divisor in A360328.at n=4A360355
- Odd numbers k such that gcd(A276086(sigma(k)-k), A276086(k)) is equal to A276086(k), where A276086 is the primorial base exp-function, and sigma is the sum of divisors function.at n=46A388267