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 A120570 #8 Jul 08 2013 18:35:33 %S A120570 12,24,32,42,60,64,84,84,96,108,132,126,156,162,156,168,204,190,228, %T A120570 210,220,240,276,250,300,312,288,294,348,312,372,336,352,408,372,378, %U A120570 444,456,416,420,492,440,516,462,468,552,564,500,588,540,544,546,636,570 %N A120570 Smallest perimeter of triangles with integer sides and inradius n. %C A120570 Empirically, 6*sqrt(3) <= a(n)/n <= 12. The lower bound is provably tight. %C A120570 a(n) == 0 (mod 4). %D A120570 Mohammad K. Azarian, Circumradius and Inradius, Problem S125, Math Horizons, Vol. 15, Issue 4, April 2008, p. 32. Solution published in Vol. 16, Issue 2, November 2008, p. 32. %H A120570 David W. Wilson, <a href="/A120570/b120570.txt">Table of n, a(n) for n = 1..10000</a> %Y A120570 See A120062 for sequences related to integer-sided triangles with integer inradius n. %K A120570 nonn %O A120570 1,1 %A A120570 _David W. Wilson_, Jun 17 2006