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.

Showing 1-1 of 1 results.

A309395 Number of integer-sided triangles with sides a,b,c, max(a,b) < c, a + c = n that are right triangles.

Original entry on oeis.org

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

Views

Author

Seiichi Manyama, Jul 28 2019

Keywords

Examples

			   n | (a,b,c)
-----+-----------------------------------------
   8 | [ 3,  4,  5]
   9 | [ 4,  3,  5]
  16 | [ 6,  8, 10]
  18 | [ 5, 12, 13], [ 8,  6, 10]
  24 | [ 9, 12, 15]
  25 | [ 8, 15, 17], [12,  5, 13]
  27 | [12,  9, 15]
  32 | [ 7, 24, 25], [12, 16, 20], [15, 8, 17]
  36 | [10, 24, 26], [16, 12, 20]
		

Crossrefs

Programs

  • PARI
    {a(n) = sum(k=n\2+1, n-1, issquare(k^2-(n-k)^2))}

Formula

a(n) > 0 if and only if n is a term in A046790.
a(n^2) = floor((n-1)/2) = A004526(n-1).
Showing 1-1 of 1 results.