60928
domain: N
Appears in sequences
- Unitary-sigma sigma multiply perfect numbers: numbers k such that A061765(k) = m*k for some integer m.at n=41A045795
- Row sums of triangle A128182.at n=12A128183
- a(n) = denominator of Product_{k=1..n} k^mu(n+1-k), where mu(k) = A008683(k).at n=17A130089
- Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 358", based on the 5-celled von Neumann neighborhood.at n=15A281310
- Numbers k such that k, k^2-1 and k^2+1 are all fine, where a number m is fine if its prime factors are all less than m^(1/3).at n=11A345896
- Irregular triangle T(n,k) read by rows in which n-th row lists in colex order all series-reduced tree degree sequences D of n nodes encoded as t = Product_{d in D} prime(d); n >= 4, 1 <= k <= A002865(n-2).at n=23A345970
- Number of edges in the hyperoctahedral (or cocktail party) graph of order n.at n=15A368757
- Numbers m such that A034448(A188999(m)) = k*m for some k, where A034448 and A188999 are respectively the unitary and the bi-unitary sigma function.at n=32A369204
- For positive integers n, a multiset A of positive integers is called "n-good" if for any number 1 <= i <= n, we can find a submultiset B of A such that the sum of B is equal to i. a(n) is the number of minimal n-good multisets.at n=32A385675