131712

Appears in sequences

• Numbers n such that n / product of digits of n is a square.at n=28A001104
• Numbers that are the product of their digits raised to positive integer powers.at n=26A059405
• Product of the prime factors of n equals the product of the digits of n.at n=11A067183
• 10-smooth numbers that show their prime factors.at n=10A075048
• a(n) = Sum_{d|n} phi(n/d)*2^(d+1), with a(0) = 0.at n=16A160619
• Integer areas of orthic triangles of integer-sided triangles.at n=13A230402
• Integer areas of the intangents triangle of integer-sided triangles.at n=19A231740
• a(n) = 6*n^3.at n=28A244726
• Number of (n+1) X (2+1) arrays of permutations of 0..n*3+2 with each element having index change +-(.,.) 0,0 0,2 or 1,0.at n=5A264202
• T(n,k)=Number of (n+1)X(k+1) arrays of permutations of 0..(n+1)*(k+1)-1 with each element having index change +-(.,.) 0,0 0,2 or 1,0.at n=26A264207
• a(n) = Sum_{d|n} (2^d - (-1)^d)*phi(3*n/d).at n=15A306899
• a(n) = Sum_{k=1..n^2, gcd(n,k) = 1} k.at n=27A308474
• Sum of sums of omegas of parts over all integer partitions of n.at n=35A325536
• Numbers m that are equal to the sum of their first k consecutive nonunitary divisors, but not all of them (i.e k < A048105(m)).at n=3A327944
• Numbers k such that the product of distinct digits of k equals the product of the prime divisors of k.at n=12A357132
• Triangle read by rows, T(n, k) = [x^k] p(n), where p(n) = 4^n * hypergeom([1/2, -n - 1, -n], [2, 2], x).at n=33A367022
• Triangle read by rows. T(n, k) = binomial(n, k)^2 * CatalanNumber(k).at n=41A367178
• Triangle read by rows: T(n, k) = (-1)^(n-k) * (2*n + 1)! * [y^(2*k)] [x^(2*n+1)] arctan(sec(x*y)*tanh(x)).at n=13A371687
• a(n) = n^3*tau(n).at n=27A386012