This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A181063 Smallest positive integer with a discrete string of exactly n consecutive divisors, or 0 if no such integer exists. 3
 1, 2, 6, 12, 3960, 60, 420, 840, 17907120, 2520, 411863760, 27720, 68502634200, 447069823200, 360360, 720720, 7600186994400, 12252240, 9524356075634400, 81909462250455840, 1149071006394511200, 232792560, 35621201198229847200, 5354228880, 91351145008363640400 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS The word "discrete" is used to describe a string of consecutive divisors that is not part of a longer such string. Does a(n) ever equal 0? a(n) = A003418(n) iff n belongs to A181062; otherwise, a(n) > A003418(n). a(A181062(n)) = A051451(n). LINKS David W. Wilson, Table of n, a(n) for n = 1..1000 EXAMPLE a(5) = 3960 is divisible by 8, 9, 10, 11, and 12, but not 7 or 13. It is the smallest positive integer with a string of 5 consecutive divisors that is not part of a longer string. CROSSREFS Cf. A181064. Sequence in context: A007668 A089415 A282974 * A161324 A226603 A116534 Adjacent sequences:  A181060 A181061 A181062 * A181064 A181065 A181066 KEYWORD nonn AUTHOR Matthew Vandermast, Oct 07 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 August 25 05:06 EDT 2019. Contains 326318 sequences. (Running on oeis4.)