27733

Properties

Appears in sequences

• Numbers k such that the continued fraction for sqrt(k) has period 49.at n=33A020388
• Prefix primes in base 8 (written in base 8).at n=49A024768
• Primes at which the difference pattern X424Y (X and Y >= 6) occurs in A001223.at n=28A052166
• a(n) is the smallest prime > LCM(1,...,x), where x is the n-th prime power (A000961).at n=8A058017
• a(n) is the smallest prime > A051451(n)+1.at n=7A058019
• Primes closest to LCM(1,...,x) either above or below. Arguments x were selected from A000961 (powers of primes including primes) in order to obtain distinct values of LCM exactly once.at n=7A058029
• a(n) = smallest prime > lcm(1..n).at n=11A060357
• a(n) = smallest prime > lcm(1..n).at n=12A060357
• Primes p such that the differences between the 5 consecutive primes starting with p are (4,2,4,6).at n=9A078952
• First prime after phi(prime(n)^2).at n=38A079477
• Smaller of a pair of consecutive primes having only prime digits.at n=15A082755
• Prime-indexed primes (PIPs) whose digits are all primes.at n=11A087368
• Lesser member p of cousin primes (p, p+4) such that (p+1, p+2, p+3) all have the same number of prime divisors (counted with multiplicity).at n=22A094230
• Primes of the form 256 k + 85.at n=24A127593
• Smallest number k such that M(n)^2-k*M(n)-1 is prime with M(n) = Mersenne primes = A000668(n).at n=25A139424
• Smallest prime p such that M(n)^2-p*M(n)-1 is prime with M(n)= Mersenne primes =A000668(n).at n=24A139428
• Primes followed by at least five consecutive primes as closely as possible.at n=22A156114
• 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=32A158024
• Primes which are triangular numbers plus 3.at n=24A159047
• Smallest integer m greater than n such that m (mod k) == n (mod k) for k = 1..n-1.at n=12A195507