login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A034298 a(n) = min_S max_i b_i where S={b_i} (1<=i<=n), b_i>0, b_i distinct and either b_i|b_{i-1} or b_{i-1}|b_i. 1
1, 2, 3, 4, 6, 6, 8, 9, 10, 12, 12, 14, 15, 16, 18, 18, 20, 21, 22, 24, 24, 26, 27, 28, 30, 30, 32, 33, 35, 36 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

For example, a(12)=14 because of {9, 3, 6, 12, 4, 8, 2, 10, 5, 1, 7, 14} and the fact that no sequence of 12 distinct positive integers < 14 has this division property.

LINKS

Table of n, a(n) for n=1..30.

E. J. Friedman, Math. Magic

CROSSREFS

Sequence in context: A112275 A278400 A239492 * A092404 A094871 A157450

Adjacent sequences:  A034295 A034296 A034297 * A034299 A034300 A034301

KEYWORD

nice,nonn

AUTHOR

Erich Friedman

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 11 00:29 EST 2016. Contains 279033 sequences.