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 A262086 #43 Mar 13 2025 08:56:28 %S A262086 3,7,13,19,31,36,37,43,61,73,79,97,103,127,139,157,163,181,223,229, %T A262086 241,271,283,307,337,349,373,379,409,421,433,439,457,499,547,577,607, %U A262086 631,643,673,691,709,733,751,787,811,829,853,877,919,937,967 %N A262086 Numbers k such that phi(k + 10) = phi(k) + 10, where phi(k) = A000010(k) is Euler's totient function. %C A262086 The only composite term less than 10^11 is 36. - _Giovanni Resta_, Sep 14 2015 %H A262086 Amiram Eldar, <a href="/A262086/b262086.txt">Table of n, a(n) for n = 1..10000</a> (terms 1..1000 from Seiichi Manyama) %H A262086 Wikipedia, <a href="https://en.wikipedia.org/wiki/Euler%27s_totient_function">Euler's totient function</a>. %e A262086 3 is in the sequence since phi(13) = phi(3) + 10. %t A262086 Select[Range@1000, EulerPhi@(# + 10) == EulerPhi[#] + 10 &] (* _Vincenzo Librandi_, Sep 11 2015 *) %o A262086 (Magma) [n: n in [1..1000] | EulerPhi(n+10) eq EulerPhi(n)+10]; // _Vincenzo Librandi_, Sep 11 2015 %o A262086 (PARI) is(n)=eulerphi(n + 10) == eulerphi(n) + 10 \\ _Anders Hellström_, Sep 11 2015 %Y A262086 Cf. A000010, A023203. %Y A262086 Cf. A001838 (k=2), A056772 (k=4), A262084 (k=6), A262085 (k=8), this sequence (k=10). %K A262086 nonn,easy %O A262086 1,1 %A A262086 _Kevin J. Gomez_, Sep 10 2015