31433

Appears in sequences

• Lonely numbers: distance to closest prime sets a new record.at n=23A051650
• Smallest number at distance n from nearest prime.at n=36A051652
• Smallest number at distance 2n from nearest prime.at n=18A051728
• Sum of factorials of digits of n equals the largest prime factor of n.at n=17A074257
• a(n) is the smallest number for which the prime distance A051699 is equal to n.at n=36A077019
• Least positive k such that the distance from k to closest prime = n.at n=36A079582
• Smallest k such that both k-n and k+n are primes and there are no primes between them.at n=36A087378
• Smallest number at distance exactly 3n from nearest prime.at n=12A132470
• Smallest number at distance 2n from nearest prime (variant 2).at n=18A132860
• Smallest number at distance 3n from nearest prime (variant 2).at n=12A132861
• Smallest number at distance 2n from nearest prime (variant 3).at n=18A133490
• Products of 3 evil primes (A027699) p,q,r, such that numbers p*q, p*r, q*r, and p*q*r are odious (A000069).at n=35A230353
• a(n) is the smallest number m, such that m+n is the next prime and m-n is the previous prime.at n=35A282690
• Smallest nonprime number <= 10^n (n>=1) with maximum distance from a prime.at n=4A306475
• List of indices where the maximum of {A316190(j) | j<=n} increases.at n=21A316191
• Number of nX6 0..1 arrays with every element unequal to 0, 1, 3, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=6A316425
• Number of nX7 0..1 arrays with every element unequal to 0, 1, 3, 5, 6 or 8 king-move adjacent elements, with upper left element zero.at n=5A316426
• Least number which differs from both of its prime neighbors by n^2, and -1 if no such number exists.at n=5A353089
• Midpoints of record gaps between primes: a(n) = (A000101(n) + A002386(n))/2 for n > 1.at n=12A354604