cp's OEIS Frontend

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.

Previous Showing 11-16 of 16 results.

A070108 Number of integer triangles with perimeter n and prime side lengths which are obtuse and isosceles.

Original entry on oeis.org

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, 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, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0
Offset: 1

Views

Author

Reinhard Zumkeller, May 05 2002

Keywords

Examples

			a(k)<=1 until k = 140, for k = 141 there are A005044(141)=432 integer triangles, a(141)=2 as
[37=37<67]: 37+37+67 = 141 and 2*(37^2)<67^2 and 37, 67 are primes,
[41=41<59]: 41+41+59 = 141 and 2*(41^2)<59^2 and 41, 59 are primes.
		

Crossrefs

A070107 Number of integer triangles with perimeter n and relatively prime side lengths which are obtuse and isosceles.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 0, 2, 1, 0, 1, 1, 0, 1, 1, 2, 1, 2, 1, 2, 0, 1, 1, 2, 1, 1, 1, 2, 1, 2, 0, 2, 1, 1, 1, 3, 1, 2, 1, 2, 1, 3, 2, 3, 1, 2, 1, 3, 1, 3, 2, 1, 1, 1, 0, 4, 2, 2, 2, 4, 1, 3, 2, 3, 2, 4, 1
Offset: 1

Views

Author

Reinhard Zumkeller, May 05 2002

Keywords

Crossrefs

A070104 Number of integer triangles with perimeter n and relatively prime side lengths which are obtuse and scalene.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 2, 1, 2, 2, 3, 1, 4, 3, 6, 2, 7, 4, 8, 4, 8, 6, 10, 6, 12, 8, 14, 8, 16, 11, 18, 11, 17, 14, 21, 12, 25, 18, 25, 15, 30, 19, 32, 20, 32, 25, 38, 23, 40, 28, 41, 28, 47, 31, 51, 34, 46, 40, 55, 35, 61, 44, 58, 41, 68
Offset: 1

Views

Author

Reinhard Zumkeller, May 05 2002

Keywords

Crossrefs

Programs

  • Maple
    f:= proc(n) local a,b,q,bmin,bmax,t;
      t:= 0;
      for a from 1 to n/3 do
        if n::even then bmin:= max(a+1,n/2-a+1) else bmin:= max(a+1,(n+1)/2-a) fi;
        q:= (n^2-2*n*a)/(2*(n-a));
        if q::integer then bmax:= min((n-a)/2, q-1) else bmax:= min((n-a)/2, floor(q)) fi;
        t:= t + nops(select(b -> igcd(a,b,n-a-b) = 1, [$bmin .. bmax]))
      od;
      t
    end proc:
    map(f, [$1..100]); # Robert Israel, Jul 26 2024

A070141 Number of obtuse integer triangles with perimeter n having integral area.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 2, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 3, 0, 0, 0, 0, 0, 1, 0, 0, 0, 3, 0, 1, 0, 0, 0, 0, 0, 3, 0, 0, 0, 1, 0, 1, 0, 2, 0, 0, 0, 4, 0, 0, 0, 1, 0, 2
Offset: 1

Views

Author

Reinhard Zumkeller, May 05 2002

Keywords

Comments

a(n) = A051516(n) - A070140(n) - A024155(n).

Crossrefs

A070206 Number of obtuse integer triangles with perimeter n having integral inradius.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 4, 0, 0, 0, 1, 0, 0
Offset: 1

Views

Author

Reinhard Zumkeller, May 05 2002

Keywords

Comments

a(n) = A070201(n) - A024155(n) - A070205(n).

References

  • 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.

Crossrefs

A308157 Sum of the perimeters of all integer-sided obtuse triangles with perimeter n.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 7, 0, 9, 0, 22, 0, 26, 28, 45, 32, 51, 54, 95, 60, 147, 88, 184, 120, 225, 182, 270, 224, 319, 270, 434, 352, 528, 408, 630, 504, 703, 646, 819, 720, 943, 882, 1161, 968, 1350, 1104, 1504, 1296, 1666, 1500, 1887, 1716, 2120, 1890, 2420
Offset: 1

Views

Author

Wesley Ivan Hurt, May 14 2019

Keywords

Crossrefs

Cf. A070101.

Programs

  • Mathematica
    Table[n*Sum[Sum[ (1 - Sign[Floor[(i^2 + k^2)/(n - i - k)^2]]) Sign[Floor[(i + k)/(n - i - k + 1)]], {i, k, Floor[(n - k)/2]}], {k, Floor[n/3]}], {n, 100}]

Formula

a(n) = n * A070101(n).
a(n) = n * Sum_{k=1..floor(n/3)} Sum_{i=k..floor((n-k)/2)} (1-sign(floor((i^2 + k^2)/(n-i-k)^2))) * sign(floor((i+k)/(n-i-k+1))).
Previous Showing 11-16 of 16 results.