cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A262086 Numbers k such that phi(k + 10) = phi(k) + 10, where phi(k) = A000010(k) is Euler's totient function.

Original entry on oeis.org

3, 7, 13, 19, 31, 36, 37, 43, 61, 73, 79, 97, 103, 127, 139, 157, 163, 181, 223, 229, 241, 271, 283, 307, 337, 349, 373, 379, 409, 421, 433, 439, 457, 499, 547, 577, 607, 631, 643, 673, 691, 709, 733, 751, 787, 811, 829, 853, 877, 919, 937, 967
Offset: 1

Views

Author

Kevin J. Gomez, Sep 10 2015

Keywords

Comments

The only composite term less than 10^11 is 36. - Giovanni Resta, Sep 14 2015

Examples

			3 is in the sequence since phi(13) = phi(3) + 10.
		

Crossrefs

Cf. A001838 (k=2), A056772 (k=4), A262084 (k=6), A262085 (k=8), this sequence (k=10).

Programs

  • Magma
    [n: n in [1..1000] | EulerPhi(n+10) eq EulerPhi(n)+10]; // Vincenzo Librandi, Sep 11 2015
    
  • Mathematica
    Select[Range@1000, EulerPhi@(# + 10) == EulerPhi[#] + 10 &] (* Vincenzo Librandi, Sep 11 2015 *)
  • PARI
    is(n)=eulerphi(n + 10) == eulerphi(n) + 10 \\ Anders Hellström, Sep 11 2015