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.

A164347 The n-th term is the minimum number x such that x/Totient(x) >= n.

Original entry on oeis.org

2, 2, 6, 30, 210, 30030, 223092870, 13082761331670030, 3217644767340672907899084554130
Offset: 1

Views

Author

Fred Schneider, Aug 13 2009

Keywords

Comments

These numbers are all primorials. Primorials necessarily must be the minimum terms in this sequence (given the nature of Euler's Totient function).
Essentially the same as A091456. - R. J. Mathar, Aug 17 2009

Examples

			2 => 2/totient(2) = 2 (so it is both the first and 2nd entry of the sequence).
30 => 30/totient(30) = 15/4 >= 3.
210 => 210/totient(210) = 210/48 >= 4.
		

Crossrefs

Each number n in this sequence is of the form: primorial(x). A164348, the related sequence, contains the x's.