Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #7 Jan 30 2016 16:35:14
%S 2,2,6,30,210,30030,223092870,13082761331670030,
%T 3217644767340672907899084554130
%N The n-th term is the minimum number x such that x/Totient(x) >= n
%C These numbers are all primorials. Primorials necessarily must be the minimum terms in this sequence (given the nature of Euler's Totient function).
%C Essentially the same as A091456. - _R. J. Mathar_, Aug 17 2009
%H Wikipedia, <a href="http://en.wikipedia.org/wiki/Euler's_totient_function">Euler's totient function</a>
%e 2 => 2/ Totient(2) = 2 (so it is both the first and 2nd entry of the sequence) 210 => 210 / Totient(210) = 210/48 >= 4
%o (PARI) mm=3; n=2; m=1; forprime(x=3,1000, n*=x; m*= (x-1); if (n\m >= mm, mm+=1;print(n))); /* Note: this will generate all terms of this sequence from the 3rd onward. The terms are easy to generate but grow very rapidly */
%Y Each number n in this sequence is of the form: primorial(x). A164348, the related sequence, contains the x's.
%K easy,nonn
%O 1,1
%A _Fred Schneider_, Aug 13 2009