login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A064162
Least abundant number divisible by n.
3
12, 12, 12, 12, 20, 12, 42, 24, 18, 20, 66, 12, 78, 42, 30, 48, 102, 18, 114, 20, 42, 66, 138, 24, 100, 78, 54, 56, 174, 30, 186, 96, 66, 102, 70, 36, 222, 114, 78, 40, 246, 42, 258, 88, 90, 138, 282, 48, 196, 100, 102, 104, 318, 54, 220, 56, 114, 174, 354, 60, 366
OFFSET
1,1
LINKS
EXAMPLE
The first eight abundant numbers are 12, 18, 20, 24, 30, 36, 40 and 42. But only the last one is divisible by 7. Therefore a(7) = 42.
MATHEMATICA
Do[ k = 11; While[ m = DivisorSigma[ 1, k ] - 2k; m <= 0 || Mod[ k, n ] != 0, k++ ]; Print[ k ], {n, 1, 75} ]
With[{abnos=Select[Range[500], DivisorSigma[1, #]>2#&]}, Table[ SelectFirst[ abnos, Divisible[ #, n]&], {n, 70}]] (* The program uses the SelectFirst function from Mathematica version 10 *) (* Harvey P. Dale, Nov 29 2015 *)
PROG
(PARI) { for (n=1, 1000, k=11; until (sigma(k) - k > k && k%n == 0, k++); write("b064162.txt", n, " ", k) ) } \\ Harry J. Smith, Sep 09 2009
CROSSREFS
Sequence in context: A123896 A122878 A302341 * A028996 A113595 A109053
KEYWORD
easy,nonn
AUTHOR
Robert G. Wilson v, Sep 15 2001
STATUS
approved