1136520

Appears in sequences

• Numbers that can be expressed as the difference of the squares of primes in exactly thirteen distinct ways.at n=16A092009
• a(n) = Fibonacci(n)*A028594(n) for n>=1, with a(0)=1, where A028594 lists the coefficients in (theta_3(x)*theta_3(7*x)+theta_2(x)*theta_2(7*x))^2.at n=20A205976
• Numbers x such that there exist a pair y, n with x < y, x != n and y != n that makes {x,y,n,n} an amicable multiset.at n=3A273970
• 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=34A344103