Define $(\ell,k)$-smough numbers to be numbers that have prime divisors $p$ of form either $p|\ell$ or $k<p$.

1. Given an $\ell$ is there a maximum $k$ above which there is no $n$ such that $q(n(n+1))$ is $(\ell,k)$-smough where $q(x)=x(x^2-1)$?

2. Is there a fast algorithm to find $n$ for a given $\ell,k$ such that $q(n(n+1))$ is $(\ell,k)$-smough?

Interesting cases at $n<100$ are at $17,31,59,89,97$:

https://www.wolframalpha.com/input/?i=Factor%28%28p%29%28p%2B1%29%28%28%28p%29%28p%2B1%29%29%5E2-1%29%29+at+p%3D17

https://www.wolframalpha.com/input/?i=Factor%28%28p%29%28p%2B1%29%28%28%28p%29%28p%2B1%29%29%5E2-1%29%29+at+p%3D31

https://www.wolframalpha.com/input/?i=Factor%28%28p%29%28p%2B1%29%28%28%28p%29%28p%2B1%29%29%5E2-1%29%29+at+p%3D59

https://www.wolframalpha.com/input/?i=Factor%28%28p%29%28p%2B1%29%28%28%28p%29%28p%2B1%29%29%5E2-1%29%29+at+p%3D89

https://www.wolframalpha.com/input/?i=Factor%28%28p%29%28p%2B1%29%28%28%28p%29%28p%2B1%29%29%5E2-1%29%29+at+p%3D97

I doubt $k$ grows much if $\ell$ is fixed.