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 A065572 #21 Jun 18 2018 03:58:29
%S A065572 1037,1541,6527,9179,55387,61133,72581,110177,152651,179297,244967,
%T A065572 299651,603461,619697,1876727,2841917,3058211,3971321,4110653,4316441,
%U A065572 4397317,6008861,10076627,10667801,10835441,11561597,24571871,36521777,45981377
%N A065572 Composite numbers k such that phi(k) = phi(k-1) + phi(k-2).
%C A065572 619697 = 13*73*653 is the smallest solution not of the form p or p*q for distinct primes p and q.
%C A065572 218688017 is the first term that has four prime factors and 32617225577 is the first term with five prime factors. 72340252337 and 179115011177 are the first two that are not squarefree. There are 175 terms less than 5*10^11. - _Jud McCranie_, Feb 20 2012
%H A065572 Harry J. Smith and Jud McCranie, <a href="/A065572/b065572.txt">Table of n, a(n) for n = 1..175</a> (first 50 terms from Harry J. Smith)
%t A065572 Select[ Range[3, 10^7], !PrimeQ[ # ] && EulerPhi[ # ] == EulerPhi[ # - 1] + EulerPhi[ # - 2] & ]
%o A065572 (PARI) { n=0; e1=eulerphi(2); e2=eulerphi(1); for (m=3, 10^9, e=eulerphi(m); if (!isprime(m) && e==e2 + e1, write("b065572.txt", n++, " ", m); if (n==100, return)); e2=e1; e1=e ) } \\ _Harry J. Smith_, Oct 23 2009
%Y A065572 Cf. A065557 (includes prime solutions).
%K A065572 nonn
%O A065572 1,1
%A A065572 _Len Smiley_ and _Robert G. Wilson v_, Nov 30 2001
%E A065572 More terms from _Jud McCranie_, Feb 21 2012