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. 5

%I

%S 1,2,6,12,3960,60,420,840,17907120,2520,411863760,27720,68502634200,

%T 447069823200,360360,720720,7600186994400,12252240,9524356075634400,

%U 81909462250455840,1149071006394511200,232792560,35621201198229847200,5354228880,91351145008363640400

%N Smallest positive integer with a discrete string of exactly n consecutive divisors, or 0 if no such integer exists.

%C The word "discrete" is used to describe a string of consecutive divisors that is not part of a longer such string.

%C Does a(n) ever equal 0?

%C a(n) = A003418(n) iff n belongs to A181062; otherwise, a(n) > A003418(n). a(A181062(n)) = A051451(n).

%H David W. Wilson, <a href="/A181063/b181063.txt">Table of n, a(n) for n = 1..1000</a>

%e 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.

%Y Cf. A181064.

%K nonn

%O 1,2

%A _Matthew Vandermast_, Oct 07 2010

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 October 19 04:40 EDT 2019. Contains 328211 sequences. (Running on oeis4.)