login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A167348 Let a(n) be the n-th term of the sequence. Let m = primorial(a(n)); m is the minimum positive integer such that m/phi(m) >= n. 0

%I

%S 2,2,3,7,13,23,43,79,149,257,461,821,1451,2549,4483,7879,13859,24247,

%T 42683,75037,131707,230773,405401,710569,1246379,2185021,3831913,

%U 6720059,11781551,20657677,36221753,63503639,111333529,195199289

%N Let a(n) be the n-th term of the sequence. Let m = primorial(a(n)); m is the minimum positive integer such that m/phi(m) >= n.

%C A variant of A091440, which is the main entry for this sequence.

%e primorial(7) = 210; 210/phi(210) = 210/48 >= 4;

%o (PARI) al(lim) = local(mm,n,m); mm=3; n=2; m=1; forprime(x=3,lim, n*=x; m*= (x-1); if (n\m >= mm, print1(x","); mm++)); /* This will generate all terms of this sequence from the 3rd onward, up to lim. The computation slows down for large values because of the size of the internal values. */

%Y Cf. A091440.

%K nonn

%O 1,1

%A _Fred Schneider_, Aug 13 2009

%E Edited and extended by _Franklin T. Adams-Watters_ and _N. J. A. Sloane_, Aug 29 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 5 16:55 EST 2021. Contains 341827 sequences. (Running on oeis4.)