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!)
A081373 Number of values of k, 1 <= k <= n, with A000010(k) = A000010(n). 29
1, 2, 1, 2, 1, 3, 1, 2, 2, 3, 1, 4, 1, 3, 1, 2, 1, 4, 1, 3, 2, 2, 1, 4, 1, 3, 2, 4, 1, 5, 1, 2, 2, 3, 1, 5, 1, 3, 2, 4, 1, 6, 1, 3, 3, 2, 1, 5, 2, 4, 1, 4, 1, 4, 2, 5, 2, 2, 1, 6, 1, 2, 3, 2, 1, 5, 1, 3, 1, 6, 1, 7, 1, 4, 3, 5, 2, 8, 1, 4, 1, 4, 1, 9, 1, 3, 1, 5, 1, 10, 2, 2, 3, 2, 3, 5, 1, 4, 4, 6 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
EXAMPLE
n=16: phi(k) = {1,1,2,2,4,2,6,4,6,4,10,4,12,6,8,8} for k=1,...,n; 2 numbers exist with phi(k) = phi(n) = 8: {15,16}, so a(16)=2.
If n=p is an odd prime number, then a(p)=1 with phi(k) = p-1.
MATHEMATICA
f[x_] := Count[Table[EulerPhi[j]-EulerPhi[x], {j, 1, x}], 0] Table[f[w], {w, 1, 100}]
PROG
(PARI) a(n)=my(t=eulerphi(n), s); sum(k=1, n, eulerphi(n)==t) \\ Charles R Greathouse IV, Feb 21 2013
CROSSREFS
Sequence in context: A072527 A345138 A343945 * A029436 A263274 A333940
KEYWORD
nonn
AUTHOR
Labos Elemer, Mar 24 2003
STATUS
approved

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 April 26 21:53 EDT 2024. Contains 372004 sequences. (Running on oeis4.)