login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A233516 Where records occur in A061026, the smallest number m such that n divides phi(m), where phi is Euler's totient function. 2

%I #4 Feb 12 2014 21:44:22

%S 1,2,3,5,7,13,17,19,31,59,85,109,133,167,197,227,317,389,457,521,799,

%T 859,1153,1163,1637,1861,1997,2053,2633,3011,3167,3721,3833,5227,6637,

%U 7213,9199,12919,13259,13469,14263

%N Where records occur in A061026, the smallest number m such that n divides phi(m), where phi is Euler's totient function.

%C Not all of these numbers are prime. The record values are in A233517.

%t t2 = {{1, 1}}; Do[k = 1; While[Mod[EulerPhi[k], n] > 0, k++]; If[k > t2[[-1,2]], AppendTo[t2, {n, k}]; Print[{n, k}]], {n, 2, 10^3}]; Transpose[t2][[1]]

%Y Cf. A061026, A233517.

%K nonn

%O 1,2

%A _T. D. Noe_, Feb 12 2014

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 02:41 EDT 2024. Contains 371696 sequences. (Running on oeis4.)