22943

Properties

Appears in sequences

• Numbers k such that k^4 == 1 (mod 5^5).at n=29A056102
• Primes p = p_(n+1) such that p_n + p_(n+2) = 2*p_(n+1) + 12.at n=23A095673
• a(n) = 997*n + 1009.at n=22A100776
• Primes of the form 8*k-1 such that 4*k-1 and 16*k-1 are also primes.at n=22A101792
• Primes of the form n^2+5*n+c (n>=0), where c=3 for even n and c=-3 for odd n.at n=30A117012
• Right truncatable primes in base 9 (written in decimal form).at n=47A129693
• Nearest integer to the space diagonal of the smallest (measured by the longest edge) primitive (gcd(a,b,c)=1) Euler bricks (a, b, c, sqrt(a^2 + b^2), sqrt(b^2 + c^2), sqrt(a^2 + c^2) are integers). If the space diagonal is an integer then the Euler brick is called a "perfect cuboid". There are no known perfect cuboids.at n=24A141029
• Primes congruent to 51 mod 59.at n=38A142778
• Numbers n such that n^2 + 1 is divisible by a 5th power.at n=14A218564
• Number of snarks of order 2n with a maximum of 4 components in any 2-factor.at n=14A218886
• Primes p such that the decimal expansion of p^5 ends in p.at n=21A224904
• Primes p such that floor(log(p)) + p^2 is prime.at n=20A225626
• Lesser of consecutive primes whose average is an oblong number.at n=37A242383
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 217", based on the 5-celled von Neumann neighborhood.at n=31A270911
• a(n) = 4^n + 3^(n + 1) - 2.at n=6A288795
• Yarborough primes that remain Yarborough primes when each of their digits are replaced by their cubes.at n=32A296563
• Smallest prime numbers characterized by a convergence speed of n, assuming a(1) = 2 (since 2^2 <> 2^2^2 (mod 10) and 2^2^2 == 2^2^2^2 (mod 10)).at n=4A339313
• Primes p such that p^5 - 1 has 8 divisors.at n=24A341665
• Primes that are no longer prime if in their binary representation any single bit is flipped but stay prime if a 1 bit is prepended.at n=38A385245
• Smallest prime number with a constant convergence speed >= n.at n=4A387664