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 A120569 #8 Jul 08 2013 18:36:03 %S A120569 0,0,1,1,0,1,0,1,1,1,0,3,0,0,2,1,0,1,0,2,2,0,0,5,0,0,1,1,0,3,0,1,1,0, %T A120569 1,4,0,0,1,3,0,3,0,1,2,0,0,5,0,1,1,1,0,1,1,1,1,0,0,8,0,0,3,1,0,1,0,1, %U A120569 1,2,0,6,0,0,2,1,0,2,0,3,1,0,0,6,0,0,1,1,0,4,0,1,1,0,0,5,0,0,2,2,0,1,0,1,5 %N A120569 Number of isosceles triangles with integer sides and inradius n. %D A120569 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 A120569 David W. Wilson, <a href="/A120569/b120569.txt">Table of n, a(n) for n = 1..10000</a> %e A120569 a(24) = 5 because 5 integer-sided isosceles triangles, namely (a,b,c) = (80,80,96), (80,85,85), (90,90,144), (130,130,240), (175,175,336), have inradius 24. %Y A120569 See A120062 for sequences related to integer-sided triangles with integer inradius n. %K A120569 nonn %O A120569 1,12 %A A120569 _David W. Wilson_, Jun 17 2006