OFFSET
1,1
COMMENTS
Inspired by the problem 141 of Project Euler (see the link).
If b is the fractional common ratio, then b = p/s irreducible > 1 and r > 0.
To get r, d, q as integers, it is necessary that r is a multiple of s^2; in this case, if r = s^2 *r' with r' >= 1, q = p*s*r' and d = p^2*r', then every m = s*r' * (s+p^3*r') with p/s>1 is a term, and the Euclidean division becomes : s*r' * (s+p^3*r') = (p^2*r') * (p*s*r') + s^2*r'. The integers (s^2*r', p*s*r', p^2*r') are in geometric progression.
When (r<q<d) is solution with m = d * q + r, then, with d' = q and q' = d, m = d' * q' + r and (r<d'<q') is also a solution with another order between remainder, divisor and quotient (see last example).
m is a term iff m = s*r' * (s+p^3*r') with r' >= 1 and p > s, p no multiple of s. For every irreducible ratio b = p/s, there are infinitely many terms.
LINKS
EXAMPLE
a(4) = 254 = 25 * 10 + 4 with (4, 10, 25) and ratio = 5/2;
a(6) = 498 = 27 * 18 + 12 with (12, 18, 27) and ratio = 3/2;
a(19) = 1740 = 49 * 35 + 25 with (25, 35, 49) and ratio = 7/5;
a(20) = 1755 = 48 * 36 + 27 with (r=27, q=36, d=48) but also 1755 = 36 * 48 + 27 with (r=27, d'=36, q'=48) both with ratio = 4/3:
1755 | 48 1755 | 36
------ ------
27 | 36 27 | 48
PROG
(PARI) isok(m) = for (d=1, m, if (m % d, q = m\d; r = m % d; if ((d % q) && (d/q == q/r), return (1)); ); ) \\ Michel Marcus, Apr 26 2020
CROSSREFS
KEYWORD
nonn
AUTHOR
Bernard Schott, Apr 26 2020
EXTENSIONS
More terms from Michel Marcus, Apr 26 2020
STATUS
approved