33923

Properties

Appears in sequences

• Third term of strong prime sextets: p(m-1)-p(m-2) > p(m)-p(m-1) > p(m+1)-p(m) > p(m+2)-p(m+1) > p(m+3)-p(m+2).at n=10A054815
• Let p run through the primes; write p in base 10 and then interpret it in base 128 getting a number q; if q is prime then adjoin q to the sequence.at n=13A090718
• Primes which are the sum of the first k nonprimes for some k >= 2.at n=25A128927
• Number of nX2 0..4 arrays with each element equal to the number its horizontal and vertical neighbors less than itself.at n=5A196424
• Number of nX6 0..4 arrays with each element equal to the number its horizontal and vertical neighbors less than itself.at n=1A196428
• T(n,k) = Number of n X k 0..4 arrays with each element equal to the number of its horizontal and vertical neighbors less than itself.at n=22A196430
• T(n,k) = Number of n X k 0..4 arrays with each element equal to the number of its horizontal and vertical neighbors less than itself.at n=26A196430
• Larger of pairs of emirps (A006567) whose difference with the (smaller) reversal is a triangular number (A000217).at n=26A217286
• Primes p such that p^2 divides 18^(p-1) - 1.at n=4A244260
• Primes p for which exactly five bases b with 1 < b < p exist such that p is a base b Wieferich prime.at n=12A255208
• T(n,k)=Number of nXk integer arrays with each element equal to the number of horizontal, diagonal and antidiagonal neighbors less than itself.at n=26A265981
• Primes that can be generated by the concatenation in base 2, in descending order, of two consecutive integers read in base 10.at n=28A287019
• Primes that can be generated by the concatenation in base 4, in descending order, of two consecutive integers read in base 10.at n=21A287303
• Solution of the complementary equation a(n) = a(n-1) + a(n-2) + b(n-1) + b(n-2) + 1, where a(0) = 1, a(1) = 3, b(0) = 2, b(1) = 4.at n=17A294415
• The first of three consecutive primes the sum of which is equal to the sum of three consecutive triangular numbers.at n=21A298169
• Prime powers of the form 12*c^2 + 4*c + 3, where c is an arbitrary integer.at n=37A309027
• Starting at n, a(n) is the difference of the number of times we move away from zero from positive spots and the number of times we move away from zero from negative spots according to the following rules. On the k-th step (k=1,2,3,...) move a distance of k in the direction of zero. If the number landed on has been landed on before, move a distance of k away.at n=34A324688
• Primes p such that exactly four numbers among all circular permutations of the digits of p are prime.at n=31A344628
• Prime numbersat n=3632