The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A338797 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A338797

Triangle read by rows: T(n,k) is the least m such that there exist positive integers x, y and z satisfying x/n + y/k = z/m where all fractions are reduced; 1 <= k <= n.
(history; published version)

#18 by Michel Marcus at Sat Nov 21 00:59:35 EST 2020

STATUS

reviewed

approved

#17 by Joerg Arndt at Sat Nov 21 00:58:42 EST 2020

STATUS

proposed

reviewed

#16 by Peter Kagey at Fri Nov 20 16:06:48 EST 2020

STATUS

editing

proposed

#15 by Peter Kagey at Fri Nov 20 16:06:45 EST 2020

LINKS

Peter Kagey, <a href="/A338797/b338797.txt">Table of n, a(n) for n = 1..10011</a> (first 141 rows, flattened)

#14 by Peter Kagey at Fri Nov 20 16:05:43 EST 2020

LINKS

Peter Kagey, <a href="/A338797/b338797.txt">Table of n, a(n) for n = 1..10011</a>

STATUS

approved

editing

#13 by Susanna Cuyler at Mon Nov 09 21:36:05 EST 2020

STATUS

proposed

approved

#12 by Peter Kagey at Mon Nov 09 18:35:24 EST 2020

STATUS

editing

proposed

#11 by Peter Kagey at Mon Nov 09 18:33:00 EST 2020

EXAMPLE

T(20,10,6) = 15 4 because 31/20 + 7/10 + 5/6 = 173/15, 4, and there is no choice of numerators on the left that results in a smaller denominator on the right.

#10 by Peter Kagey at Mon Nov 09 18:27:38 EST 2020

FORMULA

A051537(n,k) <= T(n,k) <= A221918(n,k) <= lcm(n,k) = A051173(n,k).

T(n,k) <= A221918(n,k).

#9 by Peter Kagey at Mon Nov 09 17:59:38 EST 2020

FORMULA

T(n,k) = lcm(n,k) when gcd(n,k) = 1.