161027
domain: N
Appears in sequences
- Bruckman-Lucas pseudoprimes: k | (L_k - 1), where k is composite and L_k = Lucas numbers A000032.at n=31A005845
- Composite n such that Fibonacci(n) == Legendre(n,5) == -1 (mod n).at n=15A094063
- Odd composite n such that n divides Fibonacci(n) + 1.at n=8A094395
- Composite numbers k that divide both Fibonacci(k+1) and Fibonacci(k) + 1.at n=6A094411
- Composite terms in A128288(n) = A023163(n)/3 for n>1.at n=10A128289
- Semiprimes k that divide Fibonacci(k+1).at n=23A177745
- Number of 4-divided binary words of length n.at n=17A210321
- Frobenius pseudoprimes == 2,3 (mod 5) with respect to Fibonacci polynomial x^2 - x - 1.at n=5A212423
- Frobenius pseudoprimes with respect to Fibonacci polynomial x^2 - x - 1.at n=20A212424
- Strong Lucas pseudoprimes.at n=18A217255
- Extra strong Lucas pseudoprimes.at n=19A217719
- Smallest i such that prime(n) divides gcd(sigma(i), phi(i)) (cf. A009223).at n=19A222714
- Numbers of the form p*q, p and q prime with q=2*p+3.at n=29A226754
- Odd composite integers m such that F(m)^2 == 1 (mod m) and L(m) == 1 (mod m), where F(m) and L(m) are the m-th Fibonacci and Lucas numbers, respectively.at n=24A337625