39546

Appears in sequences

• Smallest multiple of n^2 beginning with n.at n=38A078210
• Spt function: total number of smallest parts (counted with multiplicity) in all partitions of n.at n=31A092269
• Composite numbers such that the square root of the sum of squares of their prime factors is a prime.at n=17A134607
• Floor(1/{(6+n^4)^(1/4)}), where {}=fractional part.at n=38A184630
• Number of (w,x,y) with all terms in {0,...,n} and 2*w >= |x+y-z|.at n=38A213397
• Numbers k such that the product of divisors of sigma(k) is divisible by the product of divisors of k.at n=29A219362
• spt(13n+6) where spt(n) = A092269(n).at n=2A220503
• Sum of the partition parts of 3n into 3 parts.at n=25A235988
• a(n) = 26*n^2.at n=39A244633
• Numbers n such that n is the sum of two nonzero squares while n^2 is the sum of two positive cubes.at n=31A273554
• a(n) is the first k such that A277515(k) is the n-th prime.at n=24A278107
• Numbers m that can be written as x*y with phi(x)*sigma(y) = 2*x*y, where x and y are positive integers, phi(.) is Euler's totient function and sigma(y) is the sum of all positive divisors of y.at n=35A279915
• a(n) = Sum_{d|n} max(d, n/d)^3.at n=25A297842
• Sum of all the parts in the partitions of n into 5 parts.at n=39A308822
• a(1) = 0; for n > 1, a(n) = Product_{d|n, d>1, d<n} prime(1+A297167(d)).at n=77A324193
• For any number n with binary expansion Sum_{k = 1..m} 2^e_k (where 0 <= e_1 < ... < e_m), a(n) = Product_{k = 1..m} prime(1+e_k)^k (where prime(k) denotes the k-th prime number).at n=35A344530