A109042 Square array read by antidiagonals: A(n, k) = lcm(n, k) for n >= 0, k >= 0.
0, 0, 0, 0, 1, 0, 0, 2, 2, 0, 0, 3, 2, 3, 0, 0, 4, 6, 6, 4, 0, 0, 5, 4, 3, 4, 5, 0, 0, 6, 10, 12, 12, 10, 6, 0, 0, 7, 6, 15, 4, 15, 6, 7, 0, 0, 8, 14, 6, 20, 20, 6, 14, 8, 0, 0, 9, 8, 21, 12, 5, 12, 21, 8, 9, 0, 0, 10, 18, 24, 28, 30, 30, 28, 24, 18, 10, 0, 0, 11, 10, 9, 8, 35, 6, 35, 8, 9, 10, 11, 0
Offset: 0
Examples
Seen as an array: [0] 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, ... [1] 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, ... [2] 0, 2, 2, 6, 4, 10, 6, 14, 8, 18, ... [3] 0, 3, 6, 3, 12, 15, 6, 21, 24, 9, ... [4] 0, 4, 4, 12, 4, 20, 12, 28, 8, 36, ... [5] 0, 5, 10, 15, 20, 5, 30, 35, 40, 45, ... [6] 0, 6, 6, 6, 12, 30, 6, 42, 24, 18, ... [7] 0, 7, 14, 21, 28, 35, 42, 7, 56, 63, ... [8] 0, 8, 8, 24, 8, 40, 24, 56, 8, 72, ... [9] 0, 9, 18, 9, 36, 45, 18, 63, 72, 9, ... . Seen as a triangle T(n, k) = lcm(n - k, k). [0] 0; [1] 0, 0; [2] 0, 1, 0; [3] 0, 2, 2, 0; [4] 0, 3, 2, 3, 0; [5] 0, 4, 6, 6, 4, 0; [6] 0, 5, 4, 3, 4, 5, 0; [7] 0, 6, 10, 12, 12, 10, 6, 0; [8] 0, 7, 6, 15, 4, 15, 6, 7, 0; [9] 0, 8, 14, 6, 20, 20, 6, 14, 8, 0;
Links
- Alois P. Heinz, Antidiagonals n = 0..140, flattened
Crossrefs
Programs
-
Maple
T := (n, k) -> ilcm(n - k, k): for n from 0 to 9 do seq(T(n, k), k = 0..n) od; # Peter Luschny, Mar 24 2025
Formula
lcm(n, k) = n*k / gcd(n, k) for (n, k) != (0, 0).