37506

Appears in sequences

• a(n) = sum of cubes of the coefficients of x^n in x^(n-3k)*A(x^3)^(n-3k+1), as k varies from 0 to floor(n/3) for n>0, with a(0)=1.at n=12A121643
• Alexandrian integers: numbers of the form n = p*q*r such that 1/n = 1/p - 1/q - 1/r for some integers p,q,r.at n=29A147811
• a[n] = number of bit strings of length n which have exactly as many substrings 000 as substrings 111.at n=18A158422
• Values of n such that n^2 + (n-d)^2 is prime for a record first value of d.at n=20A239390
• Smallest Product_{i:lambda} prime(i) for any complete partition lambda of n.at n=30A259941
• Let p = n-th prime == 3 mod 8; a(n) = sum of quadratic residues mod p that are > p/2.at n=22A282722
• Take apart the sides of each of the integer-sided triangles with perimeter n (at their vertices) and rearrange them orthogonally in 3-space so that their endpoints coincide at a single point. a(n) is the total volume of all rectangular prisms enclosed in this way.at n=34A308233