32045

Appears in sequences

• a(n) is the product of the first n primes congruent to 1 (mod 4).at n=3A006278
• Numbers that are the sum of 2 nonzero squares in exactly 8 ways.at n=1A025291
• Numbers that are the sum of 2 nonzero squares in 6 or more ways.at n=31A025297
• Numbers that are the sum of 2 nonzero squares in 7 or more ways.at n=1A025298
• Numbers that are the sum of 2 nonzero squares in 8 or more ways.at n=1A025299
• Numbers that are the sum of 2 distinct nonzero squares in exactly 8 ways.at n=1A025309
• Numbers that are the sum of 2 distinct nonzero squares in 6 or more ways.at n=31A025316
• Numbers that are the sum of 2 distinct nonzero squares in 7 or more ways.at n=1A025317
• Numbers that are the sum of 2 distinct nonzero squares in 8 or more ways.at n=1A025318
• Integers k such that in the list of divisors of k (in base 6), each digit 0-5 appears equally often.at n=4A045815
• Numbers k such that the sum of the squares of the divisors of k is divisible by k.at n=34A046762
• Numbers of the form q1^b1 * q2^b2 * q3^b3 * q4^b4 * q5^b5 * ... where q1=5, q2=13, q3=17, q4=29, q5=37, ... (A002144) and b1 >= b2 >= b3 >= b4 >= b5 >= ....at n=16A054994
• a(n) is smallest number A such that there is an equality of the form (A=Product of n distinct primes) = (B=Product of n distinct primes) + (C=Product of n distinct primes) with gcd(A,B) = gcd(B,C) = gcd(A,C) = 1, B < C.at n=3A056600
• Numbers m such that DivisorSigma(4*k-2, m) mod m = 0 holds presumably for all k; that is, (4k-2)-power-sums of divisors of m are divisible by m for all k.at n=15A066290
• Lowest numbers which are d-Pythagorean decomposable, i.e., square is expressible as sum of two positive squares in more ways than for any smaller number.at n=8A088959
• Numbers n such that n and the four successive integers produce primes if substituted for x in the polynomial 5x^2+5x+1. See A090562, A090563. Terms show that longer similar chains also exist.at n=20A090100
• Numbers k that are the hypotenuse of exactly 40 distinct integer-sided right triangles, i.e., k^2 can be written as a sum of two squares in 40 ways.at n=0A097282
• Table read by antidiagonals of least integer "mod 4 prime signatures" k ordered by number of primitive Pythagorean triples with hypotenuse = k.at n=14A097754
• Primitive subsequence of A111105.at n=43A137559
• RMS values of the RMS numbers: a(n) is the root mean square of the divisors of A140480(n).at n=18A141812