58565

Appears in sequences

• Fermat coefficients.at n=24A000970
• a(n) = floor(C(n,4)/5).at n=53A011795
• Numbers that are the sum of 2 nonzero squares in exactly 8 ways.at n=6A025291
• Numbers that are the sum of 2 nonzero squares in 7 or more ways.at n=6A025298
• Numbers that are the sum of 2 nonzero squares in 8 or more ways.at n=6A025299
• Numbers that are the sum of 2 distinct nonzero squares in exactly 8 ways.at n=6A025309
• Numbers that are the sum of 2 distinct nonzero squares in 7 or more ways.at n=6A025317
• Numbers that are the sum of 2 distinct nonzero squares in 8 or more ways.at n=6A025318
• a(n) = n*11^n + 1.at n=4A064749
• 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=3A097282
• a(n) = 4*11^n+1.at n=4A199753
• a(n) = 4*n^4 + 1.at n=10A211412
• Numbers k such that distances from k to three nearest squares are three perfect squares.at n=15A234335
• a(n) = 10*binomial(11*n+10,n)/(11*n+10).at n=4A235340
• a(n) = binomial(5*n+8, 4)/5 for n >= 0.at n=9A238473
• Numbers n that are the product of four distinct odd primes and x^2 + y^2 = n has integer solutions.at n=3A264499
• Numbers of the form n^2 + 1 that can be expressed as j^2 + k^2, j > k > 1, in more ways than any smaller number of this form.at n=4A300162
• Numbers of the form m^2 + 1 that can be expressed in more than one way as j^2 + k^2 with j > k > 1 and gcd(j,k) = 1.at n=34A300166
• Numbers of the form n^2+1 that can be expressed as j^2+k^2, j>k>1, gcd(j,k)=1, in more ways than any smaller number of this form.at n=2A300168
• Numbers that set a record for occurrences as longest side of a primitive Heronian triangle.at n=32A306626