64553

Properties

Appears in sequences

• a(n) is the smallest prime number k such that k > n*pi(k), where pi(k) denotes the prime counting function.at n=9A038607
• Smallest prime p such that p/pi(p)>=n.at n=9A038623
• a(n) = p is the smallest prime such that p = n + h(n)^2 and p is the first prime following h(n)^2. The smallest immediate post-square primes with distance n = p - h(n)^2.at n=36A058056
• Smallest prime prime(m) such that floor(prime(m)/m) = n.at n=9A062743
• Primes p = prime(k) such that the decimal representation of p contains k as a substring.at n=1A075902
• Primes p such that the p-1 digits of the ternary (base 3) expansion of k/p (for k=1,2,3,...,p-1) fit into the k-th row of a magic square grid of order p-1.at n=16A096660
• Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k up steps starting at even heights.at n=49A101919
• Triangle read by rows: T(n,k) is the number of Schroeder paths of length 2n and having k up steps starting at an odd height.at n=39A101920
• Triangle read by rows: T(n,k) is number of ordered trees with n edges and having exactly k vertices all of whose children are leaves (1<=k<=floor(n/2) for n>=2).at n=40A114502
• Primes p such that pi(p) is obtained by dropping one of the digits of p in decimal expansion.at n=9A114924
• Numbers k such that k*(k+7) gives the concatenation of two numbers m and m+5.at n=3A116326
• Primes associated with the indices in A133583.at n=3A133584
• Triangle read by rows: T(n,k) is the number of Dyck paths of semilength n having k peak plateaux (0<=k<=floor(n/2)). A peak plateau is a run of consecutive peaks that is preceded by an upstep and followed by a down step; a peak consists of an upstep followed by a downstep.at n=53A143952
• Primes that are congruent to 3 mod n, where n is the index of the prime.at n=11A171430
• Primes p such that pi(p) = floor(p/10), where pi is the prime counting function.at n=0A236469
• Triangle read by rows: T(n,k) is the number of bargraphs of semiperimeter n having k peaks (n >= 2, k >= 1).at n=44A271940
• a(n) is the smallest x > 2 to satisfy pi(x-1)/(x-1)^n < pi(x)/x^n, where pi(x) is the prime counting function (A000720).at n=9A293010
• Initial member of 6 consecutive primes a, b, c, d, e, f such that both (f + a)/(d - c) and (e + b)/(d - c) are prime.at n=27A293619
• Primes associated with the indices in A362060.at n=9A362066
• a(n) = prime(A383318(n)).at n=0A383319