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.
%I A091456 #25 Jan 25 2025 15:28:21
%S A091456 2,6,30,210,30030,223092870,13082761331670030,
%T A091456 3217644767340672907899084554130,
%U A091456 1492182350939279320058875736615841068547583863326864530410
%N A091456 Least number k such that n * phi(k) < k, where phi is Euler's totient function.
%C A091456 By Mertens' theorem and the Prime Number Theorem log log a(n) ~ n / e^gamma. - _Charles R Greathouse IV_, Sep 07 2012
%H A091456 Amiram Eldar, <a href="/A091456/b091456.txt">Table of n, a(n) for n = 1..13</a>
%F A091456 a(n) = A002110(A005579(n)). - _Amiram Eldar_, Nov 30 2024
%o A091456 (PARI) a(n) = {k = 1; while (n*eulerphi(k) >= k, k++); k;} \\ _Michel Marcus_, Sep 25 2013
%o A091456 (PARI) a(n)=my(k=1);forprime(p=2,,if(n*eulerphi(k)<k,return(k),k*=p)) \\ _Charles R Greathouse IV_, Sep 25 2013
%Y A091456 Subsequence of A002110.
%Y A091456 Cf. A000010, A005579, A054741, A073087, A091439 (n * phi(k) <= k).
%K A091456 nonn
%O A091456 1,1
%A A091456 _Robert G. Wilson v_, Jan 10 2004