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.

A304328 a(n) = n/(largest perfect power divisor of n).

Original entry on oeis.org

1, 2, 3, 1, 5, 6, 7, 1, 1, 10, 11, 3, 13, 14, 15, 1, 17, 2, 19, 5, 21, 22, 23, 3, 1, 26, 1, 7, 29, 30, 31, 1, 33, 34, 35, 1, 37, 38, 39, 5, 41, 42, 43, 11, 5, 46, 47, 3, 1, 2, 51, 13, 53, 2, 55, 7, 57, 58, 59, 15, 61, 62, 7, 1, 65, 66, 67, 17, 69, 70, 71, 2
Offset: 1

Views

Author

Gus Wiseman, May 10 2018

Keywords

Comments

Not all terms are squarefree numbers; for example, a(500) = 4.

Crossrefs

Programs

  • Mathematica
    Table[n/Last[Select[Divisors[n],#===1||GCD@@FactorInteger[#][[All,2]]>1&]],{n,100}]
  • PARI
    a(n)={my(m=1); fordiv(n, d, if(ispower(d), m=max(m,d))); n/m} \\ Andrew Howroyd, Aug 26 2018

Formula

a(n) * A203025(n) = n.