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.

A052125 a(n) = n/A034684(n).

Original entry on oeis.org

1, 1, 1, 1, 1, 3, 1, 1, 1, 5, 1, 4, 1, 7, 5, 1, 1, 9, 1, 5, 7, 11, 1, 8, 1, 13, 1, 7, 1, 15, 1, 1, 11, 17, 7, 9, 1, 19, 13, 8, 1, 21, 1, 11, 9, 23, 1, 16, 1, 25, 17, 13, 1, 27, 11, 8, 19, 29, 1, 20, 1, 31, 9, 1, 13, 33, 1, 17, 23, 35, 1, 9, 1, 37, 25, 19, 11, 39, 1, 16, 1, 41, 1, 28, 17, 43
Offset: 1

Views

Author

James Sellers, Jan 21 2000

Keywords

Comments

The largest aliquot unitary divisor of n, for n > 1. - Amiram Eldar, Nov 08 2020

Examples

			Since A034684(6) = 2, the value of a(6) here is 6/2 = 3.
		

Crossrefs

Cf. A034684.

Programs

  • Mathematica
    a[n_] := n / Min @ (Power @@@ FactorInteger[n]); Array[a, 100] (* Amiram Eldar, Nov 08 2020 *)
  • PARI
    A052125(n) = {local(f,m);if(n==1,1,f=factor(n);m=f[1,1]^f[1,2];for(i=1,matsize(f)[1],m=min(m,f[i,1]^f[i,2]));n/m)}; \\ Michael B. Porter, Jan 28 2010