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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A136339 a(1) = 1; for all n >= 2, we choose a(n) to be as small as possible so that for all i = 1, ..., n, the sequence of the i-th divisors of a(1), a(2), ..., a(n) is nonincreasing. 0
1, 2, 4, 6, 12, 24, 48, 60, 120, 240, 360, 720, 1260, 1680, 2520, 5040, 10080, 15120, 25200, 27720, 55440, 110880, 166320, 277200, 554400, 720720, 1441440, 2162160, 3603600, 7207200, 10810800, 21621600, 43243200, 73513440, 122522400 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

The original definition of this sequence was: a(n+1) = smallest number such that the d-th divisors of a(n), a(n+1) will never increase. [What is d?]

Similar to A094783, except that only members of the sequence can disqualify larger numbers.

EXAMPLE

What is a(13), the term after 720? It cannot be 840 because 720's 13th smallest divisor is 18 and 840's 13th smallest divisor is 20 > 18.

CROSSREFS

Cf. A094783.

Sequence in context: A047151 A068010 A095848 * A019505 A135614 A115387

Adjacent sequences:  A136336 A136337 A136338 * A136340 A136341 A136342

KEYWORD

nonn

AUTHOR

J. Lowell (jhbubby(AT)mindspring.com), Mar 28 2008

EXTENSIONS

Edited by N. J. A. Sloane (njas(AT)research.att.com), Apr 04 2008. I tried to rewrite the definition to make it precise, but I am not sure I have done this correctly.

More terms from Hagen von Eitzen (math(AT)von-eitzen.de), Oct 03 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 15 07:12 EST 2012. Contains 205697 sequences.