66161

Properties

Appears in sequences

• Quartan primes: primes of the form x^4 + y^4, x > 0, y > 0.at n=27A002645
• Primes that contain digits 1 and 6 only.at n=7A020454
• Primes that remain prime through 3 iterations of function f(x) = 3x + 8.at n=36A023279
• Numbers k such that the continued fraction for sqrt(k) has odd period and if the last term of the periodic part is deleted the two central terms are both 20.at n=17A031608
• a(n) is the smallest prime p such that p^2 divides n^(p-1) - 1.at n=5A039951
• a(n) is the smallest prime p such that p^2 divides n^(p-1) - 1.at n=35A039951
• Smallest odd prime p such that p^2 | n^(p-1) - 1.at n=5A096082
• a(n) = the smallest possible prime > a(n-1) made by inserting either a 0 or a 1 anywhere in the binary representation of a(n-1) (including possibly between any two leading 0's), then converting to decimal.at n=16A166164
• Primes having only {0, 1, 6} as digits.at n=24A199326
• Primes p such that p^2 divides 6^(p-1) - 1.at n=0A212583
• Primes p such that p^2 - p - 1, p^3 - p - 1 and p^4 - p - 1 are all prime.at n=8A236173
• Numbers n such that 6^phi(n) == 1 (modulo n^2), where phi(n) is Euler's totient function.at n=0A241978
• Smallest Wieferich prime (> sqrt(n)) in base n.at n=5A247072
• Primes of the form 4^x + y^4 with x, y > 0.at n=19A250717
• Primes formed by an m-digit prime concatenated with its last (m-1) digits, for m > 1.at n=33A252667
• Primes p for which exactly six bases b with 1 < b < p exist such that p is a base b Wieferich prime.at n=5A255209
• Primes having only {1, 4, 6} as digits.at n=30A260269
• Primes having only {1, 6, 7} as digits.at n=34A260891
• Square array read by antidiagonals downwards: A(n, 1) = smallest Wieferich prime to base n and A(n, k) = smallest Wieferich prime to base A(n, k-1) for k > 1.at n=14A281001
• Semi-octavan primes: primes of the form x^4 + y^8.at n=14A291206