This site is supported by donations to The OEIS Foundation.

 Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing. Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A280441 Least composite numbers k such that the least common multiples of their aliquot parts, each one increased by n, is lesser than k. 1
 4, 9, 4, 25, 55, 49, 9, 25, 49, 121, 253, 49, 529, 129, 121, 125, 515, 133, 961, 121, 25, 529, 1081, 169, 917, 471, 361, 377, 1711, 121, 2809, 289, 529, 721, 319, 169, 2831, 1145, 961, 289, 3403, 497, 49, 529, 361, 1529, 4811, 289, 841, 781, 1339, 1369, 5671, 361 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS All terms are semiprimes or power of primes. LINKS Paolo P. Lava, Table of n, a(n) for n = 0..165 EXAMPLE a(36) = 2831 because aliquot parts of 2831 are 1, 19, 149 and lcm(1 + 36, 19 + 36, 149 + 36) = lcm(37, 55, 185) = 2035 and 2831 is the least composite number to have this property. MAPLE with(numtheory): P:=proc(q) local a, h, k, n; for n from 0 to q do for k from 1 to q do if not isprime(k) then a:=sort([op(divisors(k))]); for h from 1 to nops(a)-1 do a[h]:=a[h]+n; od; a:={op(a)}; a:=op(a minus {a[nops(a)]}); if lcm(a)

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 December 6 04:14 EST 2019. Contains 329784 sequences. (Running on oeis4.)