24885

Appears in sequences

• Odd primitive abundant numbers.at n=33A006038
• Odd primitive numbers such that n! divided by product of factorials of all proper divisors of n is not an integer.at n=31A075460
• 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=10A087415
• Integers k such that nextprime(k^5) - prevprime(k^5) = 4.at n=21A090123
• Irregular triangle of odd primitive abundant numbers (A006038) in which row n has numbers with n distinct prime factors.at n=33A188439
• The number of P-positions in the game of Nim with up to 5 piles, allowing for piles of zero, such that the number of objects in the largest pile is n.at n=20A241731
• Triangle read by rows giving numbers B(n,k) arising in the enumeration of doubly rooted tree maps.at n=42A260039
• Let p = n-th prime == 7 mod 8; a(n) = sum of quadratic residues mod p that are < p/2.at n=28A282039
• Largest denominator used in the Egyptian fraction representation of 1-1/(2n+1) by the odd greedy expansion algorithm, without repeats.at n=1A287434
• Irregular triangle read by rows where row n lists all odd primitive abundant numbers with n prime factors, counted with multiplicity.at n=32A287646
• Triangle T(n, k) = [t^n] Gamma(n + k + m + t)/Gamma(k + m + t) for m = 2 and 0 <= k <= n, read by rows.at n=32A325139
• Odd recursive abundant numbers: odd numbers k such that A333926(k) > 2*k.at n=35A333950
• Number of ways to write n as an ordered sum of 7 squarefree numbers.at n=17A341067
• Number of integer partitions of n with at least two adjacent parts of quotient 2.at n=40A350846
• Odd cubefree abundant numbers.at n=35A357697
• Cogrowth sequence of the lamplighter group Z_2 wr Z where wr denotes the wreath product.at n=6A359797
• Primitive terms of A388034.at n=46A388035