24317

Properties

Appears in sequences

• Numbers k such that the continued fraction for sqrt(k) has period 67.at n=24A020406
• a(n) is the smallest prime number k such that k > n*pi(k), where pi(k) denotes the prime counting function.at n=8A038607
• Smallest prime p such that p/pi(p)>=n.at n=8A038623
• Discriminants of real quadratic fields with class number 1 and related continued fraction period length of 23.at n=31A051964
• Ultra-useful primes: smallest k such that 2^(2^n) - k is prime.at n=16A058220
• Smallest prime prime(m) such that floor(prime(m)/m) = n.at n=8A062743
• Prime(n) and prime(n+4) use the same digits.at n=24A069796
• Pseudo-random numbers: gcc 2.6.3 version for 32-bit integers.at n=32A084276
• A variation on Flavius's sieves (A000960, A099207): Start with the Chen primes; at the k-th sieving step, remove every (k+1)-st term of the sequence remaining after the (k-1)-st sieving step; iterate.at n=40A118500
• Primes congruent to 39 mod 61.at n=38A142837
• Primes q (except greater of twin primes) with result 2 under iterations of {r mod (max prime p < r)} starting at r = q.at n=31A175080
• Primes p of the form prime(n+1)^3-prime(n)^3+1.at n=2A176136
• Primes with eight embedded primes.at n=28A179916
• Number of n X 4 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 1 1 and 1 0 1 vertically.at n=6A207415
• Number of nX7 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 1 1 and 1 0 1 vertically.at n=3A207418
• T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 1 1 and 1 0 1 vertically.at n=48A207419
• T(n,k)=Number of nXk 0..1 arrays avoiding 0 0 1 and 0 1 0 horizontally and 0 1 1 and 1 0 1 vertically.at n=51A207419
• Primes having primitive roots 2, 3, 5, 7, 11, and 13.at n=21A241047
• Primes having primitive roots 2, 3, 5, 7, 11, 13, and 17.at n=8A241048
• Consider the 10's complements mod 10 of the digits of a number k. Take their sum and repeat the process deleting the first addend and adding the previous sum. The sequence lists the numbers that after some iterations reach a sum equal to k.at n=14A263534