|
%I #18 Oct 05 2021 22:12:15
%S 0,0,1,0,1,0,2,1,2,1,4,2,5,2,5,4,8,4,10,6,9,6,14,8,15,9,16,12,21,11,
%T 24,16,22,16,27,18,33,20,31,24,40,23,44,30,39,30,52,32,54,35,52,42,65,
%U 38,65,48,64,49,80,48,85,56,77,64,90,58,102,72,93,69,114,72,120,81
%N Triangles with perimeter n and relatively prime integer side lengths.
%C From _Peter Munn_, Jul 26 2017: (Start)
%C The triangles that meet the conditions are listed by nondecreasing n in A070110.
%C Without the requirement for relatively prime side lengths, this sequence becomes A005044.
%C Counting the triangles by longest side instead of perimeter, this sequence becomes A123323.
%C a(n) = A070094(n) + A070102(n) + A070109(n).
%C (End)
%H Michael De Vlieger, <a href="/A051493/b051493.txt">Table of n, a(n) for n = 1..10000</a>
%H N. J. A. Sloane, <a href="/transforms.txt">Transforms</a>
%F Moebius transform of A005044.
%e There are 3 triangles with integer-length sides and perimeter 9: 1-4-4, 2-3-4, 3-3-3. 3-3-3 is omitted because isomorphic to 1-1-1, so a(9)=2.
%t nmax = 100;
%t A005044[n_] := Quotient[n^2 + 6n Mod[n, 2] + 24, 48];
%t A = Array[A005044, nmax];
%t mob[m_, n_] := If[ Mod[m, n] == 0, MoebiusMu[m/n], 0];
%t Reap[Do[Sow[Sum[mob[n, d] A[[d]], {d, 1, n}]], {n, 1, nmax}]][[2, 1]] (* _Jean-François Alcover_, Oct 05 2021 *)
%Y Cf. A005044, A057887, A070110, A123323.
%Y Equivalent sequences, restricted to subsets: A070091 (isosceles), A070094 (acute), A070102 (obtuse), A070109 (right-angled), A070138 (with integer area), A070202 (with integer inradius).
%K nonn
%O 1,7
%A _Neil Fernandez_
%E Corrected and extended with formula by _Christian G. Bower_, Nov 15 1999
%E Formula updated due to change to referenced sequence, and definition clarified by _Peter Munn_, Jul 26 2017
|
