A338919 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A338919

Square array of distinct positive integers T(n, k), n > 0, k > 0, read by antidiagonals upwards, filled the greedy way such that for any n > 0 and k > 0, T(n, k) is divisible by n and by k.

1, 2, 4, 3, 6, 9, 8, 12, 18, 16, 5, 20, 15, 24, 10, 30, 40, 36, 48, 50, 42, 7, 54, 45, 28, 60, 66, 14, 32, 56, 72, 80, 100, 78, 70, 64, 27, 88, 21, 84, 25, 96, 63, 104, 81, 90, 108, 120, 112, 150, 180, 140, 144, 126, 110, 11, 130, 99, 128, 35, 102, 105, 136, 117, 160, 22

(list; table; graph; refs; listen; history; text; internal format)

OFFSET

1,2

COMMENTS

All integers appear in this sequence.

LINKS

Rémy Sigrist, Table of n, a(n) for n = 1..5050

Rémy Sigrist, PARI program for A338919

Index entries for sequences that are permutations of the natural numbers

FORMULA

T(p, 1) = p for any prime number p.

EXAMPLE