experimental-projects/oeis-research/Tim Johannes Ohrtmann/Least Lucas-Carmichael number which is divisible by b(n), where {b(n)} (A255602) is the list of all numbers which could be a divisor of a Lucas-Carmichael number/find_upper_bounds.sf

#!/usr/bin/ruby

var min = 2020
var max = 3000

var multiples = (min..max -> grep { .is_coprime(.dedekind_psi) && .is_odd } )
var L = multiples.lcm

ARGF.each {|n|
    n.to_i!

    if (gcd(n, L) > 1) {
        var values = multiples.grep { .divides(n) }
        for k in (values) {
            say "#{k} #{n}"
            multiples.delete(k)
        }

        multiples || break
    }
}

if (multiples.len > 0) {
    say "Couldn't find upper-bounds for: #{multiples}"
}