%I A007614
%S A007614 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,
%T A007614 16,16,16,16,18,18,18,18,20,20,20,20,20,22,22,24,24,24,24,24,24,24,
%U A007614 24,24,24,28,28,30,30,32,32,32,32,32,32,32,36,36,36,36,36,36,36,36
%N A007614 All values attained by the phi(n) function, in ascending order.
%C A007614 Write down phi(1), phi(2), phi(3), ..., then sort this list. Of course 
               the list before sorting is simply sequence A000010.
%H A007614 T. D. Noe, <a href="b007614.txt">Table of n, a(n) for n=1..10000</a>
%H A007614 Walter Nissen, <a href="http://upforthecount.com">Home Page</a> (listed 
               in lieu of email address)
%Y A007614 Corresponding values of n are given by A032447. Cf. A000010.
%Y A007614 Sequence in context: A087627 A096491 A106160 this_sequence A113402 A054861 
               A086227
%Y A007614 Adjacent sequences: A007611 A007612 A007613 this_sequence A007615 A007616 
               A007617
%K A007614 nonn,easy,nice
%O A007614 1,3
%A A007614 Walter Nissen