58500

Appears in sequences

• Stirling numbers of the first kind: s(n+2, n).at n=25A000914
• Unitary superperfect numbers: numbers n such that usigma(usigma(n)) = 2*n, where usigma(n) is the sum of unitary divisors of n (A034448).at n=10A038843
• Numbers k such that phi(k) and cototient(k) are squares but k is not in A054755.at n=22A054756
• a(n) = binomial(2*n, n) mod ((n+1)*(n+2)*(n+3)*(n+4)).at n=23A065346
• Numbers n such that sum of digits of n equals the sum of digits of n^3.at n=37A070276
• Numbers k such that the sums of the digits of k, k^2 and k^3 coincide.at n=14A111434
• a(n) = n^2*(2*n + 5).at n=30A163683
• a(n) = 65*n^2.at n=29A165798
• Numbers with prime factorization p*q^2*r^2*s^3 (where p, q, r, s are distinct primes).at n=22A190109
• Ordered Stirling numbers S1(n,k) >= 0.at n=34A193245
• Expansion of Product_{k>=0} 1/(1-x^(3*k+1))^3.at n=31A261631
• Square array read by antidiagonals downwards: T(k,n) = sum of the site-perimeters of words of length n >= 1 over an alphabet of size k >= 1.at n=40A292767
• Numbers that are the sum of six fourth powers in six or more ways.at n=25A345563
• Numbers that are the sum of six fourth powers in seven or more ways.at n=6A345564
• Numbers that are the sum of six fourth powers in exactly seven ways.at n=5A345819
• Numbers whose square can be represented in exactly three ways as the sum of a positive square and a positive fourth power.at n=7A345968
• Numbers that are both exponential and nonexponential abundant numbers.at n=19A348627
• a(n) = n^2*sigma_2(n).at n=15A386745
• Numbers k such that the powerful part of the sum of divisors of k (A387726) is greater than or equal to k, and sigma(k) is not itself a powerful number.at n=42A387729