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.

A081397 a(n) = least k such that GCD of sigma(k) = A000203(k) and phi(k) = A000010(k) equals n-th primorial = A002110(n).

Original entry on oeis.org

3, 14, 488, 16072, 284229, 29221621, 25014312576
Offset: 1

Views

Author

Labos Elemer, Mar 28 2003

Keywords

Comments

a(8) <= 1524139588224. - Donovan Johnson, Dec 14 2009

Examples

			k=284229: sigma(284229) = 482790 = 2*3*5*7*11*19, phi(284229) = 166320 = 2*2*2*3*3*3*3*5*7*11, common factor set = {2,3,5,7,11}, gcd(sigma,phi) = 2310.
		

Crossrefs

Formula

a(n) = Min_{k : A081396(k) = A002110(n)}.

Extensions

a(6) corrected and a(7) from Donovan Johnson, Dec 14 2009