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 A039649 #35 Sep 08 2022 08:44:53
%S A039649 2,2,3,3,5,3,7,5,7,5,11,5,13,7,9,9,17,7,19,9,13,11,23,9,21,13,19,13,
%T A039649 29,9,31,17,21,17,25,13,37,19,25,17,41,13,43,21,25,23,47,17,43,21,33,
%U A039649 25,53,19,41,25,37,29,59,17,61,31,37,33,49,21,67,33,45,25,71,25,73,37,41
%N A039649 a(n) = phi(n)+1.
%C A039649 a(p) = p for p prime.
%C A039649 Records give A000040. - _Omar E. Pol_, Jul 10 2014
%C A039649 Which n are divisible by phi(n)+1? See A085118 for a possible answer and references. - _Peter Munn_, Jun 03 2021
%H A039649 Vincenzo Librandi, <a href="/A039649/b039649.txt">Table of n, a(n) for n = 1..10000</a>
%H A039649 N. J. A. Sloane, <a href="/A115004/a115004.txt">Families of Essentially Identical Sequences</a>, Mar 24 2021 (Includes this sequence)
%F A039649 a(n) = A000010(n) + 1.
%F A039649 a(n) <= n for n > 1.
%F A039649 G.f.: x/(1 - x) + Sum_{k>=1} mu(k)*x^k/(1 - x^k)^2. - _Ilya Gutkovskiy_, Mar 16 2017
%t A039649 Table[EulerPhi[n] + 1, {n, 100}] (* _Vincenzo Librandi_, Aug 13 2013 *)
%o A039649 (Magma) [EulerPhi(n)+1: n in [1..100]]; // _Vincenzo Librandi_, Aug 13 2013
%o A039649 (Haskell)
%o A039649 a039649 = (+ 1) . a000010 -- _Reinhard Zumkeller_, Oct 07 2015
%o A039649 (PARI) a(n)=eulerphi(n)+1 \\ _Charles R Greathouse IV_, Mar 04 2017
%Y A039649 Cf. A000010, A039650, A039651, A039652, A039653, A039654, A039655, A039656, A085118.
%K A039649 nonn,easy
%O A039649 1,1
%A A039649 _David W. Wilson_
%E A039649 Edited by _Charles R Greathouse IV_, Mar 18 2010.