login
A351700
T(n,k) is the maximum number of points that can be chosen from a rectangle of n X k lattice points such that their mutual distances are distinct, where T(n,k) is a triangle read by rows, 1 <= k <= n.
4
1, 2, 2, 2, 3, 3, 3, 4, 4, 4, 3, 4, 4, 5, 5, 3, 4, 5, 5, 5, 6, 4, 5, 5, 6, 6, 6, 7, 4, 5, 5, 6, 7, 7, 7, 7, 4, 5, 6, 6, 7, 7, 8, 8, 8, 4, 6, 6, 7, 7, 8, 8, 8, 9, 9, 4, 6, 6, 7, 8, 8, 8, 9, 9, 9, 10, 5, 6, 7, 7, 8, 9, 9, 9, 9, 10, 10, 10, 5, 6, 7, 8, 8, 9, 9, 10, 10, 10, 10, 11, 11
OFFSET
1,2
LINKS
Fausto A. C. Cariboni, Rows n = 1..16, flattened
EXAMPLE
The triangle begins:
1
2 2
2 3 3
3 4 4 4
3 4 4 5 5
3 4 5 5 5 6
4 5 5 6 6 6 7
4 5 5 6 7 7 7 7
4 5 6 6 7 7 8 8 8
4 6 6 7 7 8 8 8 9 9
4 6 6 7 8 8 8 9 9 9 10
5 6 7 7 8 9 9 9 9 10 10 10
5 6 7 8 8 9 9 10 10 10 10 11 11
CROSSREFS
First occurrence of n in first column: A227590.
Main diagonal: A271490.
Sequence in context: A116513 A122651 A343378 * A361928 A300013 A130535
KEYWORD
nonn,tabl,hard
AUTHOR
Hugo Pfoertner, Mar 05 2022
EXTENSIONS
T(13,2)=a(80) and T(13,8)=a(86) corrected by Fausto A. C. Cariboni, Jul 10 2022
STATUS
approved