20543

Properties

Appears in sequences

• Like A059459, but each term must be greater than the previous ones.at n=7A059661
• a(n) = r-th prime of the form (p-q)/(q-r) with r=prime(n+1), q=prime(n+2), and primes p > q.at n=61A089577
• a(n) = r-th prime of the form (p-q)/(q-r) with r=prime(n+1), q=prime(n+2), and primes p > q.at n=64A089577
• a(1) = 1; then primes associated with A091850.at n=37A091851
• Least initial value for a Euclid/Mullin sequence whose 3rd term (= least prime divisor of 1+2p) equals the n-th prime. prime(1)=2 is never a third term, so offset=2.at n=40A094464
• Balanced primes of order seven.at n=19A096699
• Balanced primes of order ten.at n=8A096702
• Primes congruent to 11 mod 59.at n=39A142738
• Primes congruent to 47 mod 61.at n=38A142845
• a(0)=3; a(n) = n^2 + a(n-1) for n>0.at n=39A153057
• Primes p such that sigma(p+2)=sigma(p-2).at n=1A169595
• Numbers k such that sigma(k - 2) = sigma(k + 2).at n=24A223091
• Prime numbers p such that p - primepi(p) is a square, where primepi is the prime counting function.at n=17A245061
• Primes p such that A276173(p) = p.at n=33A276174
• Prime time primes on 6-digit clocks, second definition: primes of the form HMMSS where H, MM, SS are primes, H < 24, MM and SS < 60.at n=11A295013
• Sum of the largest parts in the partitions of n into 7 squarefree parts.at n=48A308960
• Prime numbers p such that 0 < pi(p;10,(9,1)) = pi(p;10,(3,9)) where pi(x;q,(a,b)) is the number of primes p_n <= x such that p_n == a (mod q) and p_(n+1) == b (mod q).at n=45A326897
• Array read by downward antidiagonals: A(n,k) = Sum_{j=0..k + (k mod 3) + 1} A(n-1,j) with A(0,k) = 1, n >= 0, k >= 0.at n=51A369518
• Smallest prime p for which there are exactly n smaller primes q such that p - q is a perfect square.at n=40A386603
• Prime numbersat n=2318