46035

Appears in sequences

• Sum of unitary divisors of n^3 is a square.at n=4A064501
• Numbers n such that d(n) = phi(n+1) - phi(n), where d(n) denotes the number of divisors of n.at n=8A066171
• 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=24A087415
• Integers that are Rhonda numbers to base 12.at n=23A100971
• Odd admirable numbers: such that sigma(n) = 2n + 2d for some d | n.at n=13A109729
• Odd primitive abundant numbers of the form (2*P)^2+2*P+p^2 with P and p primes and p^2<4*P.at n=2A133778
• Odd primitive abundant numbers n such that n = x^2 + x + y^2 with y^2 < 2*x; a subsequence of A006038.at n=8A136476
• Number of n X n binary arrays symmetric under horizontal reflection with all ones connected only in a 1100-0111-0100 pattern in any orientation.at n=11A146462
• Triangle related to T(x,2x).at n=60A171150
• G.f.: A(x) = Sum_{n>=0} x^(n*(n+1)/2) / Product_{k=1..n} (1-x^k)^k.at n=35A206138
• Members of a pair (m,k) such that sigma(m) = sigma(k) = sigma(m+k), m < k where sigma = A000203.at n=19A239436
• Integers that are Rhonda numbers to base 18.at n=12A255735
• The odd part of those numbers which divide the sum of their divisors (A007691).at n=11A320024
• Odd bi-unitary admirable numbers: the odd terms of A334972.at n=2A334973
• Odd infinitary admirable numbers: the odd terms of A334974.at n=2A334975
• 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=2A335053
• Odd infinitary abundant numbers whose infinitary abundancy is closer to 2 than that of any smaller odd infinitary abundant number.at n=4A335055
• Primitive abundant numbers version 2 (abundant numbers all of whose proper divisors are deficient numbers) and increasing any prime factor in the prime factorization gives a non-abundant number when factored back.at n=35A335557
• a(n) is the number in the first column of the Trithoff (tribonacci) array that starts off the row containing the tail of n times the tribonacci sequence.at n=26A351689
• Primitive nondeficient numbers satisfying a stronger condition that compares abundancy with related numbers as detailed in the comments.at n=20A352739