id:A097850 - OEIS Search Results

Search: id:A097850

Displaying 1-1 of 1 results found.

page 1

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

+0
2

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; listen)

	OFFSET	`1,3`
	COMMENT	`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 (j.mccranie(AT)comcast.net), Aug 30 2004`
	CROSSREFS	`Cf. A079530, A097604.` `Sequence in context: A042079 A045826 A084200 this_sequence A034854 A081837 A101404` `Adjacent sequences: A097847 A097848 A097849 this_sequence A097851 A097852 A097853`
	KEYWORD	`nonn`
	AUTHOR	`njas, Aug 30 2004`

page 1

Search completed in 0.002 seconds

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.

AT&T Labs Research