|
|
A174063
|
|
Triangular array (read by rows) containing the least n integers < 2n such that no integer divides another.
|
|
2
|
|
|
1, 2, 3, 2, 3, 5, 2, 3, 5, 7, 4, 5, 6, 7, 9, 4, 5, 6, 7, 9, 11, 4, 5, 6, 7, 9, 11, 13, 4, 6, 7, 9, 10, 11, 13, 15, 4, 6, 7, 9, 10, 11, 13, 15, 17, 4, 6, 7, 9, 10, 11, 13, 15, 17, 19, 4, 6, 9, 10, 11, 13, 14, 15, 17, 19, 21, 4, 6, 9, 10, 11, 13, 14, 15, 17, 19, 21, 23, 4, 6, 9, 10, 11, 13, 14
(list;
table;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
The first number on each row is 2^k, where k is the greatest integer such that (3^k)/2 < n.
|
|
LINKS
|
|
|
EXAMPLE
|
1;
2, 3;
2, 3, 5;
2, 3, 5, 7;
4, 5, 6, 7, 9;
4, 5, 6, 7, 9, 11;
4, 5, 6, 7, 9, 11, 13;
4, 6, 7, 9, 10, 11, 13, 15;
|
|
MATHEMATICA
|
noneDivQ[L_] := NoneTrue[Subsets[L, {2}], Divisible[#[[2]], #[[1]]]&];
k1[n_] := For[k = Log[3, 2n]//Ceiling, True, k--, If[(3^k)/2<n, Return[k]]];
row[n_] := SelectFirst[Subsets[Range[2^k1[n], 2n-1], {n}], noneDivQ];
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|