55663

Properties

Appears in sequences

• Let (p1,p2), (p3,p4) be pairs of twin primes with p1*p2=p3+p4-1; sequence gives values of p2.at n=35A047977
• Second term of weak prime sextet: p(m)-p(m-1) < p(m+1)-p(m) < p(m+2)-p(m+1) < p(m+3)-p(m+2) < p(m+4)-p(m+3).at n=17A054829
• Primes p(x) satisfying the following conditions: (a) A082882(x)=1; (b) {p(x),p(x+1)} are not twin primes; (c) values of A075860(j) for j composites between these two non-twin primes are identical.at n=16A082883
• Primes of the form k^2 + k + 55661, with k >= 0.at n=1A116206
• Beginnings of maximal chains of primes with four members (three links).at n=17A152867
• Primes having only {3, 5, 6} as digits.at n=28A260225
• Number of nX5 0..1 arrays with every element equal to 2, 3 or 4 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=6A300462
• Number of nX7 0..1 arrays with every element equal to 2, 3 or 4 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=4A300464
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 2, 3 or 4 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=59A300465
• T(n,k)=Number of nXk 0..1 arrays with every element equal to 2, 3 or 4 horizontally, vertically or antidiagonally adjacent elements, with upper left element zero.at n=61A300465
• Zero-avoiding Fibonacci sequence: a(n) is the largest zeroless number that can be written as a(i) + a(j) where 1 <= i < j < n with a(1) = a(2) = 1.at n=24A374924
• Prime numbersat n=5648