39287

Appears in sequences

• Number of numbers of complexity n, i.e., that can be built from n ones using + and *, and require at least that many ones.at n=35A005421
• a(n) = floor( n^Pi ).at n=28A061294
• Numbers k such that sum of divisors of k is a square and a triangular number (A000217). That is, numbers k such that A000203(k) is in A001110.at n=12A232847
• Sum of prime parts, counted without multiplicity, in all compositions of n.at n=14A336579
• Numbers whose distance to the nearest cube equals the distance to the nearest product of 3 consecutive integers (three-dimensional oblong).at n=33A342873
• a(n) = number of partitions p of n such that the greatest multiplicity of the parts of p is not a part of p.at n=43A365616