OFFSET

1,1

COMMENTS

Old name was: A special sequence of primes.

Holt shows this sequence is complete. - T. D. Noe, Jul 28 2005

This sequence was used by Schinzel (1958) and Schinzel and Wakulicz (1959) to prove that there are at least two solutions k to phi(n+k) = phi(k) for all n <= 8*10^47 and 2*10^58, respectively. - Amiram Eldar, Mar 19 2021

REFERENCES

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Jeffery J. Holt, The minimal number of solutions to phi(n)=phi(n+k), Math. Comp., 72 (2003), 2059-2061.

A. Schinzel and Andrzej Wakulicz, Sur l'équation phi(x+k)=phi(x), I., Acta Arith. 4 (1958), 181-184. - Jonathan Sondow, Oct 07 2012

A. Schinzel and Andrzej Wakulicz; Sur l'équation phi(x+k)=phi(x). II. Acta Arith. 5 1959 425-426.

CROSSREFS

KEYWORD

nonn,fini,full

AUTHOR

EXTENSIONS

New name, giving a definition, by Jonathan Sondow, Oct 06 2012

STATUS

approved