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.
%I A300285 #8 Mar 04 2018 23:14:56
%S A300285 2,3,10,17,36,68,142,306,651,1267,2567,5236,10755
%N A300285 The number of solutions to phi(x) = phi(x+1) below 10^n, where phi(x) is the Euler totient function.
%C A300285 Data extracted from A001274.
%C A300285 The terms were calculated by:
%C A300285 a(1)-a(2) - R. Ratat (1917).
%C A300285 a(3) - Victor L. Klee, Jr. (1947).
%C A300285 a(4)-a(5) - Mohan Lal and Paul Gillard (1972).
%C A300285 a(6) - David Ballew, Janell Case and Robert N. Higgins (1975).
%C A300285 a(7)-a(8) - Robert Baillie (1976).
%C A300285 a(9)-a(10) - Sidney West Graham, Jeffrey J. Holt, and Carl Pomerance (1999).
%C A300285 a(11) - _T. D. Noe_ (2009).
%C A300285 a(12) - _Jud McCranie_ (2012).
%C A300285 a(13) - _Giovanni Resta_ (2014).
%D A300285 R. Ratat, L'Intermédiaire des Mathématiciens, Vol. 24, pp. 101-102, 1917.
%H A300285 R. Baillie, <a href="http://dx.doi.org/10.1090/S0025-5718-76-99669-1">Table of phi(n) = phi(n+1)</a>, Math. Comp., 30 (1976), pp. 189-190.
%H A300285 David Ballew, Janell Case, and Robert N. Higgins, <a href="https://doi.org/10.1090/S0025-5718-75-99680-5">Table of phi(n)= phi(n+1)</a>, Math. Comput., Vol. 29, pp. 329-330, 1975.
%H A300285 Sidney West Graham, Jeffrey J. Holt, and Carl Pomerance,<a href="https://www.researchgate.net/profile/Sidney_Graham2/publication/228376782_On_the_solutions_to_ph_n_ph_n_k/links/54a582c30cf267bdb9082549.pdf">On the solutions to phi(n)= phi(n+ k)</a>, Number Theory in Progress, Proceedings of the International Conference in Honor of the 60th Birthday of A. Schinzel, Poland, 1997, Walter de Gruyter, 1999, pp. 867-882.
%H A300285 V. L. Klee, Jr., <a href="http://www.jstor.org/stable/2305207">Some remarks on Euler's totient function</a>, Amer. Math. Monthly, 54 (1947), p. 332.
%H A300285 Mohan Lal and Paul Gillard, <a href="http://dx.doi.org/10.1090/S0025-5718-1972-0319391-6">On the equation phi(n) = phi(n+k)</a>, Math. Comp., 26 (1972), pp. 579-583.
%H A300285 Leo Moser, <a href="http://www.jstor.org/stable/2305815">Some equations involving Euler's totient function</a>, Amer. Math. Monthly, 56 (1949), pp. 22-23.
%F A300285 According to _Thomas Ordowski_'s conjecture in A001274, a(n) ~ 10^(C*n/3), where C = 9/Pi^2 = 0.911891... Numerically it seems that C ~ 0.93.
%e A300285 Below 10^2 there are 3 solutions x = 1, 3, 15, hence a(2) = 3.
%t A300285 With[{s = Array[EulerPhi, 10^6]}, Array[Count[Range[10^# - 1], _?(s[[#]] == s[[# + 1]] &)] &, IntegerLength@ Length@ s - 1]] (* _Michael De Vlieger_, Mar 04 2018 *)
%Y A300285 Cf. A000010, A001274.
%K A300285 nonn,more
%O A300285 1,1
%A A300285 _Amiram Eldar_, Mar 01 2018