The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A174063 Triangular array (read by rows) containing the least n integers (using lexicographic order) all less than 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; CROSSREFS Cf. A174062, A174094. Sequence in context: A249049 A138239 A112484 * A327277 A124459 A283360 Adjacent sequences:  A174060 A174061 A174062 * A174064 A174065 A174066 KEYWORD nonn,tabl AUTHOR David Brown, Mar 07 2010 EXTENSIONS Definition corrected by David Brown, Mar 20 2010 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified February 18 15:30 EST 2020. Contains 332019 sequences. (Running on oeis4.)