100127
domain: N
Appears in sequences
- Number of achiral rooted trees.at n=36A003241
- Bruckman-Lucas pseudoprimes: k | (L_k - 1), where k is composite and L_k = Lucas numbers A000032.at n=26A005845
- Values of n where number of permutations of digits a(n) that are prime increases.at n=18A046891
- Numbers k such that sigma(k+1) = 3 * sigma(k).at n=7A077087
- a(n) = A083964(n)/(2n-1).at n=35A083965
- Smallest k such that n times concatenation of k with itself followed by a 7 is a prime, or 0 if no such number exists.at n=35A087605
- Composite n such that Fibonacci(n) == Legendre(n,5) == -1 (mod n).at n=9A094063
- Odd composite n such that n divides Fibonacci(n) + 1.at n=5A094395
- Composite numbers k that divide both Fibonacci(k+1) and Fibonacci(k) + 1.at n=4A094411
- Semiprimes k that divide Fibonacci(k+1).at n=19A177745
- Composite numbers k that divide both Fibonacci(k+1) and Fibonacci(2k+1)-1.at n=34A182504
- Frobenius pseudoprimes == 2,3 (mod 5) with respect to Fibonacci polynomial x^2 - x - 1.at n=3A212423
- Frobenius pseudoprimes with respect to Fibonacci polynomial x^2 - x - 1.at n=16A212424
- Strong Lucas pseudoprimes.at n=12A217255
- Extra strong Lucas pseudoprimes.at n=12A217719
- Numbers of the form p*q, p and q prime with q=2*p+3.at n=24A226754
- 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=19A337625
- Record values in A356640.at n=27A356642