113573

Appears in sequences

• Bruckman-Lucas pseudoprimes: k | (L_k - 1), where k is composite and L_k = Lucas numbers A000032.at n=28A005845
• Numerators of continued fraction convergents to sqrt(393).at n=11A041746
• Composite n such that Fibonacci(n) == Legendre(n,5) == -1 (mod n).at n=10A094063
• Odd composite n such that n divides Fibonacci(n) + 1.at n=6A094395
• Composite numbers k that divide both Fibonacci(k+1) and Fibonacci(k) + 1.at n=5A094411
• Greatest multiple of the n-th prime in A098962.at n=32A099620
• Records in A109890.at n=20A111242
• a(n) = A109890(A111315(n)).at n=2A111316
• Composite terms in A128288(n) = A023163(n)/3 for n>1.at n=8A128289
• Lucas pseudoprimes whose reversal is prime.at n=2A164824
• Semiprimes k that divide Fibonacci(k+1).at n=20A177745
• Frobenius pseudoprimes == 2,3 (mod 5) with respect to Fibonacci polynomial x^2 - x - 1.at n=4A212423
• Frobenius pseudoprimes with respect to Fibonacci polynomial x^2 - x - 1.at n=17A212424
• Strong Lucas pseudoprimes.at n=13A217255
• Extra strong Lucas pseudoprimes.at n=13A217719
• Number of (n+1)X(n+1) 0..2 arrays with every 2X2 subblock diagonal minus antidiagonal sum nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=5A253488
• Number of (n+1) X (6+1) 0..2 arrays with every 2 X 2 subblock diagonal minus antidiagonal sum nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=5A253493
• Number of (6+1) X (n+1) 0..2 arrays with every 2 X 2 subblock diagonal minus antidiagonal sum nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=5A253500
• Odd terms in A259934.at n=4A262517
• 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=21A337625