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 A059495 #8 Mar 30 2012 17:36:51 %S A059495 1,3,3,45,3,381,2349,115329357,10279641655875,5033685952807971, %T A059495 5263826472436016979, %U A059495 898670952308059000662208200339860406351380028634597445743368513219427297854627,1163046333059983884005407440923089001865672520479660324278034104804471332063117356524700189 %N A059495 For odd p such that 2^p-1 is a prime (A000043), write 2^p-1 = x^2+3*y^2; sequence gives values of y. %D A059495 F. Lemmermeyer, Reciprocity Laws From Euler to Eisenstein, Springer-Verlag, 2000, p. 59. %H A059495 Phil Moore, Tony Reix and others, <a href="http://www.mersenneforum.org/showthread.php?t=345">Online Discussion</a> %e A059495 p=7: 127 = 10^2 + 3*3^2, so a(3) = 3. %Y A059495 Cf. A000043, A000668, A059494. %K A059495 nonn,easy %O A059495 1,2 %A A059495 _N. J. A. Sloane_, Feb 05 2001 %E A059495 More terms from _Joshua Zucker_, May 23 2006