174080
domain: N
Appears in sequences
- Droll numbers: numbers > 1 whose sum of even prime factors equals the sum of odd prime factors.at n=19A019507
- Numbers k such that prime(k)+1 divides k^2.at n=4A062061
- Numbers k such that sigma(phi(k)) is a prime.at n=43A062514
- Numbers k such that usigma(phi(k)) is a prime.at n=31A065875
- Expansion of (1-x)/(1+2*x^2+2*x^3).at n=27A078037
- Numbers k such that phi(k) is a perfect 8th power.at n=20A078168
- Matrix square of triangle A063967.at n=47A091700
- Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 22", based on the 5-celled von Neumann neighborhood.at n=22A285437
- Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 84", based on the 5-celled von Neumann neighborhood.at n=22A285774
- Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 126", based on the 5-celled von Neumann neighborhood.at n=21A285944
- Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 510", based on the 5-celled von Neumann neighborhood.at n=22A288808
- Numbers h such that 2^phi(h) == phi(h) (mod h).at n=31A292544
- Number of nonisomorphic proper colorings of partition star graph using five colors.at n=52A297569
- Number of nonisomorphic proper colorings of partition star graph using five colors.at n=57A297569
- Nonprime Heinz numbers of integer partitions whose product is equal to their sum.at n=22A301988
- Least d > 0 such that both Q = M + 2d and R = M + (M^2-1)/(Q-M) are prime, where M = 2^n - 1 = A000225(n), or 0 if there is no such d.at n=32A320875
- Numbers m such that all elements of the Collatz trajectory occur in the divisors of m.at n=41A323097
- a(n) = n*(1 - (-1)^n - 2*(3 + (-1)^n)*n^2 + 2*n^4)/384.at n=32A350689
- Triangle T(n,k) read by rows in which n-th row lists in increasing order all multiplicative partitions mu of n whose sum is also n (with factors >= 1), encoded as Product_{j in mu} prime(j); n>=1, 1<=k<=A001055(n).at n=42A377852