25339

Properties

Appears in sequences

• Primes of form Sum_{k=1..n} (prime(k)+1).at n=38A062736
• a(1) = 2, a(2) = 3; for n > 0, a(n+2) is the smallest prime chosen so that (a(n+2) - a(n+1))/(a(n+1) - a(n)) is an integer.at n=19A084736
• Primes of the form p = prime(k) = (prime(k+3)+prime(k-1))/2.at n=23A126238
• Number of n X n binary arrays with all ones connected only in a 1000-1000-1000-1111 pattern in any orientation.at n=8A147091
• Number of n X n binary arrays symmetric under horizontal and vertical reflection with all ones connected only in a 1000-1000-1000-1111 pattern in any orientation.at n=18A147093
• Number of n X n binary arrays symmetric under horizontal and vertical reflection with all ones connected only in a 1000-1000-1000-1111 pattern in any orientation.at n=19A147093
• Primes p such that p^3 - 12 and p^3 + 12 are also primes.at n=30A153322
• Greater of two consecutive primes, p < q, such that both p*q+p-q and p*q-p+q are prime numbers.at n=31A154552
• Primes p such that all the digits needed to write the consecutive Primes from 2 to p fill exactly a square (no holes, no overlaps).at n=30A158024
• a(n) = 15n^2 + 3n + 1.at n=40A165806
• Sequence of row differences related to table A182355.at n=6A182193
• Triangle read by rows: T(n,k) is the number of secondary structures of size n having k stacks of even length (n>=0, k>=0).at n=36A202848
• Smallest prime p such that 2n+1 = 2p - q^3 for some odd prime q, or 0 if no such prime exists.at n=11A224794
• Let m = n-th number not divisible by 3 (A001651); a(n) = position of m in A065075, or -1 if never appears in A065075.at n=33A230289
• Prime generating polynomial: a(n) = (4*n - 29)^2 + 58.at n=46A320772
• Expansion of Product_{i>=1, j>=0} (1 + x^(i * 3^j)).at n=49A327726
• Primes p such that (p+2)/3 and (p+3)/2 are prime.at n=46A338410
• Primes p such that (p+nextprime(p))/6 is prime and 6*p is the sum of two consecutive primes.at n=28A339775
• Primes p such that p-2 is the product of two emirps.at n=37A345198
• a(0) = 2; afterwards a(n) is the least prime greater than a(n-1) such that Omega(a(n-1) + a(n)) = n.at n=13A357713