This site is supported by donations to The OEIS Foundation.

"Email this user" was broken Aug 14 to 9am Aug 16. If you sent someone a message in this period, please send it again.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A133689 a(n) = smallest integer that is > n and is a multiple of every proper divisor of n. 0
 3, 4, 6, 6, 12, 8, 12, 12, 20, 12, 24, 14, 28, 30, 24, 18, 36, 20, 40, 42, 44, 24, 48, 30, 52, 36, 56, 30, 60, 32, 48, 66, 68, 70, 72, 38, 76, 78, 80, 42, 84, 44, 88, 90, 92, 48, 96, 56, 100, 102, 104, 54, 108, 110, 112, 114, 116, 60 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 COMMENTS a(n) = A048671(n) + n. LINKS EXAMPLE The proper divisors of 16 are 1,2,4,8. a(16)=24 is the smallest integer which is both > 16 and is a multiple of 1, of 2, of 4 and of 8. MATHEMATICA a = {}; For[n = 2, n < 60, n++, i = n + 1; While[Length[Union[Mod[i, Complement[Divisors[n], {n}]]]] > 1, i++ ]; AppendTo[a, i]]; a (* Stefan Steinerberger, Aug 30 2008 *) CROSSREFS Cf. A048671. Sequence in context: A230593 A158523 A001615 * A285895 A220345 A135510 Adjacent sequences:  A133686 A133687 A133688 * A133690 A133691 A133692 KEYWORD nonn AUTHOR Leroy Quet, Dec 31 2007 EXTENSIONS More terms from Stefan Steinerberger, Aug 30 2008 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.