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.

Showing 1-1 of 1 results.

A161656 The largest multiple of {the sum of the distinct prime divisors of n} that is <=n.

Original entry on oeis.org

0, 2, 3, 4, 5, 5, 7, 8, 9, 7, 11, 10, 13, 9, 8, 16, 17, 15, 19, 14, 20, 13, 23, 20, 25, 15, 27, 27, 29, 30, 31, 32, 28, 19, 24, 35, 37, 21, 32, 35, 41, 36, 43, 39, 40, 25, 47, 45, 49, 49, 40, 45, 53, 50, 48, 54, 44, 31, 59, 60, 61, 33, 60, 64, 54, 64, 67, 57, 52, 70, 71, 70, 73
Offset: 1

Views

Author

Leroy Quet, Jun 15 2009

Keywords

Comments

a(n)=n iff n belongs to A089352. - Ivan Neretin, May 25 2016

Crossrefs

Programs

  • Maple
    A161656 := proc(n)
        local sd;
        if n <= 1 then
            0;
        else
            sd := A008472(n) ;
            sd*floor(n/sd) ;
        end if;
    end proc: # R. J. Mathar, Mar 14 2014
  • Mathematica
    Join[{0}, Table[Floor[#1/#2]*#2 &[n, Plus @@ FactorInteger[n][[All, 1]]], {n, 2, 73}] ](* Ivan Neretin, May 25 2016 *)

Extensions

More terms from Sean A. Irvine, Sep 29 2009
Showing 1-1 of 1 results.