51941

Properties

Appears in sequences

• Smallest prime that generates a prime pyramid of height n.at n=8A034276
• Cyclotomic polynomials Phi_n at x=phi, rounded to nearest integer (where phi = tau = (sqrt(5)+1)/2).at n=39A063705
• Cyclotomic polynomials Phi_n at x=phi, ceiled up (where phi = tau = (sqrt(5)+1)/2).at n=39A063707
• Primes from merging of 5 successive digits in decimal expansion of Pi.at n=33A104825
• An 8th-degree product form sequence: a(n)=Product[(1 + 4*Sin[k*Pi/n]^2 + 16*Sin[k*Pi/n]^4 + 64*Sin[k*Pi/n]^6 + 256*Sin[k*Pi/n]^8), {k, 1, Floor[(n - 1)/2]}].at n=7A152144
• Primes p in A068209 whose squares never divide (x+1)^p-x^p-1 and x^x+(x+1)^(x+1) for the same x.at n=1A165284
• First primes beginning a chain of 4 primes indexed equidistantly (n-th, (n+b)-th, (n+2b)-th, (n+3b)-th primes) whose sum of squares is the square of two times a prime and with b <= n.at n=33A214265
• Number of nX5 0..1 arrays with each 1 adjacent to 2 or 4 king-move neighboring 1s.at n=5A296036
• Number of nX6 0..1 arrays with each 1 adjacent to 2 or 4 king-move neighboring 1s.at n=4A296037
• T(n,k)=Number of nXk 0..1 arrays with each 1 adjacent to 2 or 4 king-move neighboring 1s.at n=49A296039
• T(n,k)=Number of nXk 0..1 arrays with each 1 adjacent to 2 or 4 king-move neighboring 1s.at n=50A296039
• Prime numbersat n=5314