70111

Properties

Appears in sequences

• a(0)=1; a(1)=1; a(n)= a(n-1) + floor(sqrt(a(n-1)*a(n-2))) + floor(sqrt(a(n-3)*a(n-4))) + ....at n=18A043328
• 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=20A054815
• a(1) = 2; a(n+1) is the smallest prime > a(n) which differs from it in every digit.at n=37A068853
• Prime numbers p of the form 10k+1 for which the pentanacci quintic polynomial x^5-x^4-x^3-x^2-x-1 modulus p is factorizable into five binomials.at n=12A135843
• Primes p such that 2*p^4-+15 are also prime.at n=30A174366
• Primes having only {0, 1, 7} as digits.at n=31A199327
• Let p_(3,1)(m) be the m-th prime == 1(mod 3). Then a(n) is the smallest p_(3,1)(m) such that the interval(p_(3,1)(m)*n, p_(3,1)(m+1)*n) contains exactly one prime == 1(mod 3).at n=28A210465
• Primes of the form 2*n^2 + 42*n + 19.at n=20A221903
• a(n) = floor(6^n/(3+sqrt(3))^n).at n=47A240735
• Prime numbers containing the string 111.at n=31A243527
• Prime numbersat n=6946