42210

Appears in sequences

• n written efficiently in natural numbers base, i.e., in form ...wxyz where n =1*z + 2*y + 3*x + 4*w + ... with z < 1, y < 2, x < 3, w < 4, ...at n=34A055992
• (Sum of digits of n)^5 - (sum of digits^5 of n).at n=27A069965
• Triangle T(n, k) = 1 if k = 0 or k = n, otherwise n^5 - k^5 - (n-k)^5, read by rows.at n=47A157634
• Triangle T(n, k) = 1 if k = 0 or k = n, otherwise n^5 - k^5 - (n-k)^5, read by rows.at n=52A157634
• Numbers n such that d(n + d(n)) = d(n), where d(n) is the sum of the distinct primes dividing n.at n=38A175760
• Triangle read by rows: coefficients psi(n,k) arising from the study of completely transitive graphs on n nodes.at n=19A259972
• Number of minimal dominating sets in the n-Andrásfai graph.at n=18A286879
• Sum over all partitions of n of the GCD of the number of parts and the number of distinct parts.at n=37A339312
• G.f. A(x) satisfies A(x) = 1 + x/A(-x*A(x)^2)^3.at n=9A384897
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals downwards, where column k is the expansion of B(x)^k, where B(x) is the g.f. of A384897.at n=64A384902
• Primitive terms of A023197 that are of the form 4u+2.at n=28A388020