|
%I #6 Mar 30 2012 18:50:20
%S 0,0,0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,
%T 0,0,0,0,1,0,1,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,0,1,0,
%U 1,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,1,0,1,0
%N Number of integer triangles with perimeter n and prime side lengths which are obtuse and isosceles.
%H R. Zumkeller, <a href="/A070080/a070080.txt">Integer-sided triangles</a>
%e a(k)<=1 until k = 140, for k = 141 there are A005044(141)=432 integer triangles, a(141)=2 as
%e [37=37<67]: 37+37+67 = 141 and 2*(37^2)<67^2 and 37, 67 are primes,
%e [41=41<59]: 41+41+59 = 141 and 2*(41^2)<59^2 and 41, 59 are primes.
%Y Cf. A070080, A070081, A070082, A070101, A059169, A070088, A070092, A070103, A070106, A070135.
%K nonn
%O 1,1
%A _Reinhard Zumkeller_, May 05 2002
|
