26881

Properties

Appears in sequences

• Where prime race 4m-1 vs. 4m+1 is tied.at n=8A007351
• a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 3, and a(3) = 4.at n=16A049928
• Numbers k such that k^3 is a cube whose digits occur with an equal minimum frequency of 2.at n=20A052051
• Primes followed by a [10,2,10] prime difference pattern of A001223.at n=23A052376
• Numbers n such that n, 10*n+1, 10*n+3, 10*n+7 and 10*n+9 are all primes.at n=7A067267
• Magnanimous primes: primes with the property that inserting a "+" in any place between two digits yields a sum which is prime.at n=48A089392
• Prime mean of 8 horizontal, vertical and main diagonal sums associated with primes in A094454.at n=28A094455
• Largest prime factor of n^4 + 1.at n=25A096172
• Primes p such that the number of primes less than p equal to 1 mod 4 is one less than the number of primes less than p equal to 3 mod 4.at n=21A096448
• Elite primes: a prime number p is called elite if only a finite number of Fermat numbers 2^(2^n)+1 are quadratic residues mod p.at n=6A102742
• a(n) is the smallest n-digit zeroless prime such that the sum of the two numbers that result from splitting a(n) between any two of its digits is a distinct prime, or 0 if there is no such n-digit prime.at n=3A103547
• Primes of the form 512n+257.at n=9A105131
• Fixed points for prime number permutation A108546.at n=14A108547
• Expansion of (1-x)^2/((1-x)^4-2x^4).at n=14A119330
• Terms in A006512 containing the digit "6" at least once, such that changing every "6" to a "9" and vice versa yields a larger term in A006512.at n=7A123211
• Row sums of triangle A134484(n,k) = 2^[n(n-1) - k(k-1)] * C(n,k).at n=4A134485
• Prime numbers p such that p +- ((p-1)/4) are primes.at n=27A137705
• Primes of the form (4*n^2-8*n-9)/3.at n=36A154616
• a(1)=2, a(n+1) is the smallest prime with sum of even digits >= sum of even digits of a(n).at n=43A156614
• Primes of the form floor(k+A000217(k-1)*Pi), Pi = A000796, k integer.at n=21A163580