37380

Appears in sequences

• Amicable triples: numbers such that sigma(x) = sigma(y) = sigma(z) = x+y+z, x<y<z. We order these triples according to the common value of sigma. Sequence gives x numbers.at n=4A125490
• Numbers n that raised to the powers from 1 to k (with k>=1) are multiple of the sum of their digits (n raised to k+1 must not be a multiple). Case k=11.at n=12A135196
• Polynomial expansion sequence: p(x)=1/(1 - 4x + 5x^2 - 6x^4 + 6x^5 - x^6 - 2x^7 + x^8).at n=17A143075
• Numerator of Euler(n, 7/19).at n=4A156720
• Expansion of g.f.: Product_{k>=1} 1+k*x^k/(1-x^k)^2.at n=17A163318
• Numbers that belong to at least one amicable tuple.at n=29A255215
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of e.g.f. Product_{i>0} Sum_{j=0..k} x^(j*i)/j!.at n=62A293135
• E.g.f.: Product_{m>0} (1+x^m+x^(2*m)/2!+x^(3*m)/3!).at n=7A293195
• Column k=2 of triangle A257673.at n=11A321947
• Numbers n for which 2 < A257993(A276086(A276086(n))) < A257993(n), where A276086 converts the primorial base expansion of n into its prime product form, and A257993 returns the index of the least prime not present in its argument.at n=24A328762
• a(n) is the smallest number k >= 1 with exactly n divisors d, for which sigma(k) is divisible by d*sigma(d).at n=19A344103
• Product of Fibonacci and self-convolution of Fibonacci numbers: a(n) = A000045(n+1)*A001629(n+1).at n=10A372015