Square-freeness conjecture for the factors of a divisibility sequence

Let (an)(a_n) be a divisibility sequence with factorization an=dnbda_n=\prod_{d\mid n}b_d. An integer is square-free if it is not divisible by the square of any prime.

Square-freeness conjecture. If nn is square-free, then bnb_n is square-free.

The paper presents this as a stronger version of the open question of whether the relevant Fibonacci-type terms are square-free. The supplied status is unknown, so the conjecture is recorded as open.

Sources & referencesView supporting material

Primary source

Masum Billal, “Exponent Lifting Property of Integer Sequences”, arXiv:1509.03288 (2021).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.