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.

A066636 a(n) = A066638(n)/n, where A066638(n) is the smallest power of a squarefree kernel of n that is a multiple of n.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 2, 1, 5, 1, 1, 1, 9, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 25, 1, 1, 1, 11, 5, 1, 1, 27, 1, 2, 1, 13, 1, 4, 1, 49, 1, 1, 1, 15, 1, 1, 7, 1, 1, 1, 1, 17, 1, 1, 1, 3, 1, 1, 3, 19, 1, 1, 1, 125, 1, 1, 1, 21, 1
Offset: 1

Views

Author

Reinhard Zumkeller, Jan 09 2002

Keywords

Comments

a(n) is the least m such that the prime power exponents of m*n are all equal; see also A062760. - David James Sycamore, Jun 13 2024

Examples

			12 = 2^2*3^1 so m = 3 (3*12 = 36 = 2^2*3^2).
		

Crossrefs

Programs

Formula

a(n) = (A007947(n)^A051903(n))/n. - Antti Karttunen, Nov 20 2017