OFFSET
1,1
COMMENTS
Let p be the n-th prime number. Put 1 to p^2 into a square array in order. Choose a set of primes such that there is one and only one in each row and column. Then T(n, k) gives the first of solutions for the n-th prime according to the size of the selected prime numbers.
REFERENCES
Martin Erickson, Beautiful Mathematics, Mathematical Association of America, 2011, p. 6 (Transversal of primes).
EXAMPLE
Triangle starts with:
2, 3;
3, 5, 7;
5, 7, 11, 19, 23;
7, 11, 17, 23, 29, 41, 47;
...
For n = 4, p = 7 there are two solutions {7, 11, 17, 23, 29, 41, 47} and {7, 11, 19, 23, 31, 41, 43}, the first of which is listed in the table.
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
Martin Renner, Oct 20 2024
STATUS
approved