Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A110175
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A110175 Composite numbers n such that the equation phi(n)=phi(k)+phi(n-k) has no solution, where phi is Euler's totient function. +0
2
6, 30, 49, 81, 91, 95, 115, 121, 155, 187, 205, 210, 221, 243, 254, 259, 287, 298, 299, 329, 341, 355, 361, 377, 403, 415, 437, 451, 469, 473, 502, 533, 551, 559, 565, 611, 625, 629, 649, 655, 662, 667, 674, 679, 685, 703, 713, 731, 737, 746, 767, 779, 781 (list; graph; listen)
OFFSET

1,1

COMMENT

The only prime for which this equation has a solution is 3.

MATHEMATICA

a[n_] := Select[Range[n-1], EulerPhi[n]==EulerPhi[n-# ]+EulerPhi[ # ]&]; t=Table[Length[a[n]], {n, 1000}]; Complement[Flatten[Position[t, 0]], Prime[Range[PrimePi[1000]]]]

CROSSREFS

Cf. A110173 (least k such that phi(n)=phi(k)+phi(n-k)).

Sequence in context: A090126 A100194 A070195 this_sequence A014203 A044083 A024406

Adjacent sequences: A110172 A110173 A110174 this_sequence A110176 A110177 A110178

KEYWORD

nonn

AUTHOR

T. D. Noe (noe(AT)sspectra.com), Jul 15 2005

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

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


AT&T Labs Research