Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A110196
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A110196 Numbers n such that k=2n is the least k such that phi(n+k)=2*phi(k). +0
2
1, 13, 23, 97, 113, 131, 199, 227, 491, 859, 929 (list; graph; listen)
OFFSET

1,2

COMMENT

No other n < 10^6. Note that all n>1 are primes.

MATHEMATICA

Do[k=1; While[EulerPhi[n+k] != 2*EulerPhi[k], k++ ]; If[k==2n, Print[n]], {n, 5000}]

CROSSREFS

Cf. A050473 (least k such that phi(n+k)=2*phi(k)).

Sequence in context: A155093 A147443 A131447 this_sequence A111943 A039448 A089768

Adjacent sequences: A110193 A110194 A110195 this_sequence A110197 A110198 A110199

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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research