36792

Appears in sequences

• a(n) = Z(S_m; sigma[1](n), sigma[2](n),..., sigma[m](n)) where Z(S_m; x_1,x_2,...,x_m) is the cycle index of the symmetric group S_m and sigma[k](n) is the sum of k-th powers of divisors of n; m=3.at n=25A068020
• Consider iteration of the function f(x) = sigma(phi(x)) = A062402(x). Sequence lists the numbers k such that the trajectory of k returns to k.at n=35A096998
• Triangle read by rows: T(n,h) = number of functions f:{1,2,...,n}->{1,2,...,n-1} such that |Image(f)|=h, h=1,2,...,n-1, n=2,3,...at n=37A101819
• Triangle read by rows: T(n,h) = number of functions f:{1,2,...,n}->{1,2,...,n-2} such that |Image(f)|=h, h=1,2,...,n-2; n=3,4,....at n=29A101821
• Numbers divisible by at least five of their digits, different and >1.at n=2A187533
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 65", based on the 5-celled von Neumann neighborhood.at n=38A270085
• Number of inequivalent ways to color the edges of a tetrahedron using at most n colors so that no color appears more than twice.at n=9A282820
• Number of entries in the ninth cycles of all permutations of [n].at n=3A285237
• Primitive terms of A259850.at n=39A361363
• Array read by downward antidiagonals: A(n,k) = A(n,k-1) + (k+1)*(A(n-1,k) + A(n-1,k+1)) with A(n,0) = A(n-1,0) + A(n-1,1), A(0,k) = 1, n >= 0, k >= 0.at n=39A379460