23763

Appears in sequences

• 3p^2 where p runs through the primes.at n=23A079705
• a(n) = cosh( (2n - 1)*arcsinh(sqrt(2)) )^2 = 1 - cos( (2n - 1)*arcsin(sqrt(3)) )^2.at n=2A146313
• Odd numbers k such that A166100((k-1)/2)/k is not an integer.at n=26A166102
• a(n) = 10*a(n-1)-a(n-2)-4 with a(1)=1 and a(2)=3.at n=5A171640
• Number of nontrivial solutions (x,y,z) for each prime number p of the Fermat equation x^p + y^p + z^p = 0 mod (n) where n is prime of the form n = 2p + 1, and x, y, z are integers such that x < = y.at n=10A172426
• a(n) = sin^2((2n-1)*arcsin(sqrt n)) = 1 - sin^2( (2n-1)*arccos(sqrt n)).at n=3A173170
• Numbers of the form x^2 + y^2 + z^2 = phi(x*y*z) + sigma(x*y*z).at n=30A173792
• 3*h^2, where h is an odd integer not divisible by 3.at n=29A229852
• Expansion of x*(1 + 2*x - 96*x^2 - 148*x^3 + 45*x^4 + 50*x^5 + 2*x^6)/(1 - 99*x^2 + 99*x^4 - x^6).at n=7A268251
• Numbers that are the sum of three squares in arithmetic progression.at n=36A292313
• Number of total dominating sets in the n-pan graph.at n=19A302506
• Numbers k(n) used for Cassels's Markoff forms MF(n) corresponding to the conjectured unique Markoff triples MT(n) with maximal entry m(n) = A002559(n), for n >= 1.at n=28A305310
• Numbers p^2*q, p > q odd primes such that q divides p+1.at n=17A350245
• Characteristic numbers of Markov triples in the binary tree A368546.at n=32A368134