A097850 - OEIS

This site is supported by donations to The OEIS Foundation.

A097850

Floor(2*sqrt(n)*phi(n))-n.

1, 0, 3, 4, 12, 3, 24, 14, 27, 15, 55, 15, 73, 30, 46, 48, 114, 32, 137, 51, 88, 71, 188, 54, 175, 96, 160, 98, 272, 57, 303, 149, 196, 152, 248, 108, 400, 183, 260, 162, 471, 113, 507, 221, 276, 252, 583, 173, 539, 232, 406, 294, 704, 210, 538, 303, 486, 368, 832, 187, 876 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,3`
	COMMENTS	`Always >= 0. But see A079530 and A097604 for stronger upper bounds on n/phi(n).`
	REFERENCES	`David Burton, Elementary Number Theory" 4th edition, problem 7a in section 7.2 has the equivalent of n/phi(n) <= 2*sqrt(n). - Jud McCranie (JudMcCranie(AT)ugaalum.uga.edu), Aug 30 2004`
	CROSSREFS	`Cf. A079530, A097604.` `Sequence in context: A042079 A045826 A084200 * A034854 A164982 A081837` `Adjacent sequences: A097847 A097848 A097849 * A097851 A097852 A097853`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Aug 30 2004`

Content is available under The OEIS End-User License Agreement .

Last modified February 14 00:47 EST 2012. Contains 205567 sequences.