login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A264810 Number of numbers k <= n such that phi(m) = k for some m. 3

%I #7 Mar 14 2018 06:01:01

%S 1,2,2,3,3,4,4,5,5,6,6,7,7,7,7,8,8,9,9,10,10,11,11,12,12,12,12,13,13,

%T 14,14,15,15,15,15,16,16,16,16,17,17,18,18,19,19,20,20,21,21,21,21,22,

%U 22,23,23,24,24,25,25,26,26,26,26,27,27,28,28,28,28

%N Number of numbers k <= n such that phi(m) = k for some m.

%C Partial sums of A264739;

%C a(n) = n - A180639(n).

%H Reinhard Zumkeller, <a href="/A264810/b264810.txt">Table of n, a(n) for n = 1..10000</a>

%o (Haskell)

%o a264810 n = a264810_list !! (n-1)

%o a264810_list = scanl1 (+) a264739_list

%o (PARI) first(n)=my(s); vector(n,k,s+=istotient(k)) \\ _Charles R Greathouse IV_, Sep 02 2015

%Y Cf. A000010, A002202, A264739.

%K nonn

%O 1,2

%A _Reinhard Zumkeller_, Nov 26 2015

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 14 21:48 EDT 2024. Contains 375929 sequences. (Running on oeis4.)