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.

A322170 Triangle T(n, k) read by rows, n > 0 and 0 < k <= 3^(n-1): T(n, k) = A321768(n, k) * A321769(n, k) / 2.

Original entry on oeis.org

6, 30, 210, 60, 84, 1320, 630, 1560, 7140, 1386, 924, 2340, 210, 180, 4620, 2730, 10920, 45144, 7854, 7980, 23184, 2574, 5016, 63336, 26910, 49476, 242556, 50490, 25200, 57420, 4290, 3570, 34650, 12540, 14490, 79794, 18564, 5610, 10374, 504, 330, 11970, 7956
Offset: 1

Views

Author

Rémy Sigrist, Nov 29 2018

Keywords

Comments

This sequence gives the areas of the primitive Pythagorean triangles corresponding to the primitive Pythagorean triples in the tree described in A321768.
If we order the terms in this sequence and keep duplicates then we obtain A024406.

Examples

			The first rows are:
   6
   30, 210, 60
   84, 1320, 630, 1560, 7140, 1386, 924, 2340, 210
T(1,1) corresponds to the area of the triangle with sides 3, 4, 5; hence T(1, 1) = 3 * 4 / 2 = 6.
		

Crossrefs

Programs

  • PARI
    M = [[1, -2, 2; 2, -1, 2; 2, -2, 3], [1, 2, 2; 2, 1, 2; 2, 2, 3], [-1, 2, 2; -2, 1, 2; -2, 2, 3]];
    T(n, k) = my (t=[3; 4; 5], d=digits(3^(n-1)+k-1, 3)); for (i=2, #d, t = M[d[i]+1] * t); return (t[1, 1] * t[2, 1] / 2)

Formula

Empirically:
- T(n, 1) = A055112(n),
- T(n, (3^(n-1) + 1)/2) = A029549(n),
- T(n, 3^(n-1)) = A069072(n-1).