23773

Properties

Appears in sequences

• Sextan primes: p = (x^6 + y^6)/(x^2 + y^2).at n=31A002647
• Primes that divide at least one term of Sylvester's sequence s = A000058: s(n+1) = s(n)^2 - s(n) + 1, s(0) = 2.at n=39A007996
• Numbers k such that the continued fraction for sqrt(k) has period 55.at n=34A020394
• Primes that are palindromic in base 12.at n=33A029979
• Numbers k such that if P = 10*k^2+1, then P, P+6, P+12 and P+18 are all primes.at n=44A092446
• Primes that are a concatenation of 2, 3 and a prime.at n=26A101218
• Primes that are either single-digit primes or a concatenation of two earlier terms.at n=27A104179
• Primes with prime number of only prime digits (i.e., 2, 3, 5, 7).at n=31A124888
• Let f(k) = exp(Pi*sqrt(k)); sequence gives numbers k such that ceiling(f(k)) - f(k) < 1/10^3.at n=36A127022
• Home primes whose homeliness is greater than 4.at n=17A133963
• Home primes whose homeliness is 5.at n=12A133964
• Primes with eight embedded primes.at n=22A179916
• Primes of the form 3n^2 + 10.at n=15A201480
• Primes that contain only the digits (2, 3, 7).at n=35A214704
• a(n) = n*p(n)-spt(n) (= n*A000041(n) - A092269(n)).at n=22A220907
• a(n) = Least integer k such that it takes n iterations of "factor and reverse bits of odd prime divisors" (A235027) before a fixed point or cycle of 2 is reached; records in A235145.at n=5A235146
• Number of n X n 0..1 arrays with no 1 equal to more than three of its king-move neighbors.at n=3A282392
• Number of nX4 0..1 arrays with no 1 equal to more than three of its king-move neighbors.at n=3A282395
• T(n,k)=Number of nXk 0..1 arrays with no 1 equal to more than three of its king-move neighbors.at n=24A282399
• Numbers k such that (68*10^k - 11)/3 is prime.at n=19A293399