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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A097604 a(n) = floor( phi(n)*sqrt(2*n) ) - n. 2
 0, 0, 1, 1, 7, 0, 15, 8, 16, 7, 35, 7, 48, 17, 28, 29, 76, 18, 91, 30, 56, 44, 126, 31, 116, 60, 105, 61, 184, 31, 205, 96, 129, 97, 165, 65, 272, 118, 172, 103, 321, 67, 346, 143, 182, 165, 398, 108, 366, 150, 272, 192, 482, 133, 364, 197, 327, 243, 571, 115, 601, 272, 341 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 COMMENTS This is known to be always >= 0, i.e. that n/phi(n) <= sqrt(2n) holds for all n. This is a consequence of the stronger inequality in A079530. REFERENCES D. S. Mitrinovic et al., Handbook of Number Theory, Kluwer, p. 9. LINKS G. C. Greubel, Table of n, a(n) for n = 1..10000 MATHEMATICA Table[Floor[Sqrt[2*n]*EulerPhi[n]] - n, {n, 1, 100}] (* G. C. Greubel, Jan 14 2019 *) PROG (PARI) vector(100, n, (sqrt(2*n)*eulerphi(n))\1 -n) \\ G. C. Greubel, Jan 14 2019 (MAGMA) [Floor(Sqrt(2*n)*EulerPhi(n)) - n: n in [1..100]]; // G. C. Greubel, Jan 14 2019 (Sage) [floor(sqrt(2*n)*euler_phi(n)) - n for n in (1..100)] # G. C. Greubel, Jan 14 2019 CROSSREFS Cf. A079530, A097850. Sequence in context: A331423 A240825 A243773 * A240816 A007393 A245543 Adjacent sequences:  A097601 A097602 A097603 * A097605 A097606 A097607 KEYWORD nonn AUTHOR N. J. A. Sloane, based on emails from Alonso del Arte and Jud McCranie, Aug 30 2004 STATUS approved

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.

Last modified March 28 07:59 EDT 2020. Contains 333079 sequences. (Running on oeis4.)