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 A065604 #4 Mar 30 2012 17:34:49
%S A065604 3,1037,619697,218688017,32617225577
%N A065604 a(n) = smallest k satisfying the equation phi(k) = phi(k-1) + phi(k-2) and having just n prime factors.
%e A065604 a(1) = 3 which is prime and is the first term in A065557, a(2) = 1037 = 17*61 which is the first term in A065572, a(3) = 619697=13*73*653
%t A065604 a = Table[0, {4}]; x = y = 1; Do[ z = EulerPhi[n]; If[z == x + y, If[l = Length[ FactorInteger[ n]]; a[[l]] == 0, a[[l]] = n; Print[n]]]; x = y; y = z, {n, 3, 10^7 } ]; a
%Y A065604 Cf. A065557 and A065572.
%K A065604 hard,nonn
%O A065604 1,1
%A A065604 _Robert G. Wilson v_, Dec 01 2001
%E A065604 a(5) from _Donovan Johnson_, Feb 05 2010