84490

Appears in sequences

• a(n) = n*(2*n^2 + 5*n + 3).at n=34A163815
• For bases b = 2, 3, ..., n, let the base-b expansion of n be [c_{1,b} c_{2,b} .. c_{r_b,b}], with the most significant "digit" on the left, 0 <= c_{i,b} < b, and c_{1,b} != 0; then a(n) is the number whose base-n expansion is the sum of all those expansions, regarding the c_{i,j} as integers mod n.at n=15A247880
• Numbers that are the sum of nine fifth powers in three or more ways.at n=30A345620
• Numbers that are the sum of nine fifth powers in exactly three ways.at n=29A346338
• Triangular array read by rows: T(n,k) is the number of endofunctions f:{1,2,...,n}-> {1,2,...,n} whose smallest connected component has exactly k nodes; n >= 0, 0 <= k <= n.at n=31A347999
• Triangle read by rows: T(n,k) is the number of endofunctions on [n] whose second-smallest component has size exactly k; n >= 0, 0 <= k <= max(0,n-1).at n=26A350079
• Expansion of Sum_{k>=1} k^4 * x^k/(1 - x^k)^4.at n=16A366933