67103

Properties

Appears in sequences

• a(1)=1, a(n+1)=ceiling(phi*a(n))+1 if a(n) is odd, a(n+1)=ceiling(phi*a(n)) if a(n) is even, where phi=(1+sqrt(5))/2.at n=21A092263
• a(n) = smallest prime divisor of A138957(n).at n=36A138960
• Primes p such that 4*p is greater than the greatest prime factor of p^4 -1 and p^4 + 1.at n=17A218849
• Primes p such that both (p^2 + 5)/6 and (p^4 + 5)/6 are prime.at n=39A253925
• Primes p such that (p^2 + 5)/6, (p^4 + 5)/6 and (p^6 + 5)/6 are prime.at n=2A253939
• Primes p such that (p^2 + 5)/6, (p^4 + 5)/6, and (p^8 + 5)/6 are prime.at n=2A253940
• Primes p such that (p^2 + 5)/6, (p^4 + 5)/6, (p^6 + 5)/6 and (p^8 + 5)/6 are prime.at n=0A253976
• Primes p such that p+-2 and p+-4 are semiprimes.at n=22A266845
• Primes p such that p+/-2, p+/-4 and p+/-6 are semiprimes.at n=2A266847
• a(n) = a(n-1) + a(n-3) + a(n-4), where a(0) = 1, a(1) = 1, a(2) = 1, a(3) = -1.at n=27A295671
• Square array read by antidiagonals upwards: T(n,k) for integer k >= 0 is the n-th prime p such that p^(2*3^k) + p^(3^k) + 1 is prime.at n=51A344448
• Prime numbersat n=6685