code: def is_strong_lucas_prp(n):
      """Strong Lucas compositeness test with Selfridge parameters.  Returns
      False if n is definitely composite, and True if n is a strong Lucas
      probable prime.
  
      This is often used in combination with the Miller-Rabin test, and
      in particular, when combined with M-R base 2 creates the strong BPSW test.
  
      References
      ==========
      .. [1] Robert Baillie, Samuel S. Wagstaff, Lucas Pseudoprimes,
             Math. Comp. Vol 35, Number 152 (1980), pp. 1391-1417,
             https://doi.org/10.1090%2FS0025-5718-1980-0583518-6
             http://mpqs.free.fr/LucasPseudoprimes.pdf
      .. [2] OEIS A217255: Strong Lucas Pseudoprimes
             https://oeis.org/A217255
      .. [3] https://en.wikipedia.org/wiki/Lucas_pseudoprime
      .. [4] https://en.wikipedia.org/wiki/Baillie-PSW_primality_test
  
      Examples
      ========
  
      >>> from sympy.ntheory.primetest import isprime, is_strong_lucas_prp
      >>> for i in range(20000):
      ...     if is_strong_lucas_prp(i) and not isprime(i):
      ...        print(i)
      5459
      5777
      10877
      16109
      18971
      """
      n = as_int(n)
      if n < 2:
          return False
      return is_strong_selfridge_prp(n)
  
imports: from itertools import count
  from sympy.core.sympify import sympify
  from sympy.external.gmpy import gmpy, gcd, jacobi, is_square, bit_scan1, is_fermat_prp, is_euler_prp, is_selfridge_prp, is_strong_selfridge_prp, is_strong_bpsw_prp
  from sympy.external.ntheory import _lucas_sequence
  from sympy.utilities.misc import as_int, filldedent
label_desc: Use image node_id 9 for calling a global function with example usage: is_strong_lucas_prp(n) and returns: is_strong_selfridge_prp, False