35572

Appears in sequences

• Sums of 2 successive primes s = prime(m) + prime(m+1) such that all digits of s are primes.at n=29A173719
• a(n) = 1 + (n-1) + (n-2)*[(n-3)/2] + (n-3)*[(n-4)/2]*[(n-5)/3] + (n-4)*[(n-5)/2]*[(n-6)/3]*[(n-7)/4] +... where [x] = floor(x), with summation extending over the initial [n/2+1] products only.at n=24A207644