id:A007614 - OEIS Search Results

Search: id:A007614

Displaying 1-1 of 1 results found.

page 1

All values attained by the phi(n) function, in ascending order.

+0
7

1, 1, 2, 2, 2, 4, 4, 4, 4, 6, 6, 6, 6, 8, 8, 8, 8, 8, 10, 10, 12, 12, 12, 12, 12, 12, 16, 16, 16, 16, 16, 16, 18, 18, 18, 18, 20, 20, 20, 20, 20, 22, 22, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 28, 28, 30, 30, 32, 32, 32, 32, 32, 32, 32, 36, 36, 36, 36, 36, 36, 36, 36 (list; graph; listen)

	OFFSET	`1,3`
	COMMENT	`Write down phi(1), phi(2), phi(3), ..., then sort this list. Of course the list before sorting is simply sequence A000010.`
	LINKS	`T. D. Noe, Table of n, a(n) for n=1..10000` `Walter Nissen, Home Page (listed in lieu of email address)`
	CROSSREFS	`Corresponding values of n are given by A032447. Cf. A000010.` `Sequence in context: A087627 A096491 A106160 this_sequence A113402 A054861 A086227` `Adjacent sequences: A007611 A007612 A007613 this_sequence A007615 A007616 A007617`
	KEYWORD	`nonn,easy,nice`
	AUTHOR	`Walter Nissen`

page 1

Search completed in 0.002 seconds

Last modified December 20 16:54 EST 2009. Contains 171081 sequences.

AT&T Labs Research