101065

Appears in sequences

• Expansion of Product_{k>=1} (1 - x^k)^17.at n=15A010823
• Numbers that are the sum of 2 nonzero squares in exactly 8 ways.at n=26A025291
• Numbers that are the sum of 2 nonzero squares in 7 or more ways.at n=28A025298
• Numbers that are the sum of 2 nonzero squares in 8 or more ways.at n=28A025299
• Numbers that are the sum of 2 distinct nonzero squares in exactly 8 ways.at n=26A025309
• Numbers that are the sum of 2 distinct nonzero squares in 7 or more ways.at n=28A025317
• Numbers that are the sum of 2 distinct nonzero squares in 8 or more ways.at n=28A025318
• Numbers with exactly one arithmetic progression of four successive divisors (not necessarily consecutive).at n=38A094530
• 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=16A097282
• Triangle read by rows: characteristic polynomials of certain matrices, see Mathematica program.at n=59A124040
• RMS values of the RMS numbers: a(n) is the root mean square of the divisors of A140480(n).at n=23A141812
• RMS values of the Primitive RMS numbers: a(n) is the Root Mean Square of the divisors of A141813(n).at n=11A141814
• Numbers n that are the product of four distinct odd primes and x^2 + y^2 = n has integer solutions.at n=12A264499
• Numbers k such that 3*10^k + 11 is prime.at n=21A295396
• Product of the smaller primes, p, in the Goldbach partitions of 2n such that p + q = 2n, p <= q, and p,q prime (or 1 if no Goldbach partition of 2n exists).at n=43A362641
• Irregular triangle read by rows: T(n,k) (n >= 4, 4 <= k <= A384502(n)) is the smallest n-digit number m with k distinct prime factors, such that these factors can be divided into two subsets of at least two elements each, both summing to the same value. If no such number exists, T(n,k) = -1.at n=4A383858