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 A085758 #6 Mar 31 2012 13:20:48 %S A085758 5,1,2,4,6,16,18,20,12,24,80,198,1134,352,156,36,168,108,468,72,312, %T A085758 528,880,180,1280,192,144,660,1848,120,384,4500,216,3564,2100,240,288, %U A085758 648,600,7968,1656,1536,1620,432,1560,3672,1944,360,840,2496,8820,1008,576 %N A085758 Least m such that phi(x)=2m has exactly n solutions. %C A085758 Sequence refers to the rank of the first occurrence of n in A032446. %F A085758 a(n) = A007374(n)/2 for n > 2. - _David Wasserman_, Feb 09 2005 %e A085758 a(0) = 7. Carmichael conjectured that a(1) doesn't exist. %Y A085758 Cf. A032446. %K A085758 nonn %O A085758 2,1 %A A085758 _Lekraj Beedassy_, Jul 22 2003 %E A085758 More terms from _David Wasserman_, Feb 09 2005