|
|
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
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
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.
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|