|
Search: id:A133689
|
|
|
| A133689 |
|
a(n) = smallest integer that is > n and is a multiple of every proper divisor of n. |
|
+0
1
|
|
| 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; listen)
|
|
|
OFFSET
|
2,1
|
|
|
COMMENT
|
a(n) = A048671(n) + n.
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
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 [From Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Aug 30 2008]
|
|
CROSSREFS
|
Cf. A048671.
Sequence in context: A053158 A158523 A001615 this_sequence A135510 A065967 A117986
Adjacent sequences: A133686 A133687 A133688 this_sequence A133690 A133691 A133692
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Leroy Quet Dec 31 2007
|
|
EXTENSIONS
|
More terms from Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Aug 30 2008
|
|
|
Search completed in 0.002 seconds
|
