cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A064162 Least abundant number divisible by n.

Original entry on oeis.org

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

Views

Author

Robert G. Wilson v, Sep 15 2001

Keywords

Examples

			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.
		

Programs

  • 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 *)
  • 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