A190313 -id:A190313 - cp's OEIS frontend

A028419 Congruence classes of triangles which can be drawn using lattice points in n X n grid as vertices.

0, 1, 8, 29, 79, 172, 333, 587, 963, 1494, 2228, 3195, 4455, 6050, 8032, 10481, 13464, 17014, 21235, 26190, 31980, 38666, 46388, 55144, 65131, 76449, 89132, 103337, 119184, 136757, 156280, 177796, 201430, 227331, 255668, 286606, 320294, 356884, 396376, 439100, 485427, 535049, 588457, 645803

Offset: 0

David J. Rusin

nonn

Ron Knott, Table of n, a(n) for n = 0..60
D. Rusin, Lattice Problem (Triangles) [Dead link]
D. Rusin, Lattice Problem (Triangles) [Cached copy]

Cf. A028492, A189979, A190021, A190022, A189978, A190313, A189978, A190313.

a:=proc(n) local TriangleSet,i,j,k,l,A,B,C; TriangleSet:={}: for i from 0 to n do for j from 0 to n do for k from 0 to n do for l from 0 to n do A:=i^2+j^2: B:=k^2+l^2: C:=(i-k)^2+(j-l)^2: if A^2+B^2+C^2<>2*(A*B+B*C+C*A) then TriangleSet:={op(TriangleSet),sort([sqrt(A),sqrt(B),sqrt(C)])}: fi: od: od: od: od: return(nops(TriangleSet)); end: # Martin Renner, May 03 2011

More terms from Chris Cole (chris(AT)questrel.com), Jun 28 2003

a(36)-a(39) from Martin Renner, May 08 2011

A241236 Number of scalene triangles, distinct up to congruence, on a centered hexagonal grid of size n.

Original entry on oeis.org

0, 1, 19, 99, 310, 760, 1556, 2863, 4849, 7713, 11702, 17077, 24066, 33021, 44272, 58180, 75148, 95526, 119758, 148489, 181924, 220796, 265519, 316736, 375006, 441061, 515467, 598680, 691761, 795410, 909971, 1036745, 1176108, 1329286, 1496711, 1679852, 1879036, 2095235

Offset: 1

Martin Renner, Apr 17 2014

nonn

A centered hexagonal grid of size n is a grid with A003215(n-1) points forming a hexagonal lattice.

			For n = 2 the only kind of non-congruent scalene triangles is the following:
/. *
* . *
\. .

Eric Weisstein's World of Mathematics, Hex Number.
Eric Weisstein's World of Mathematics, Scalene Triangle.

Cf. A190313, A241227.

a(n) = A241231(n) - A241237(n).

a(7) from Martin Renner, May 31 2014
a(8)-a(13) from Giovanni Resta, May 31 2014
More terms from Bert Dobbelaere, Oct 17 2022

A272053 a(n) is the number of equivalence classes of simple, open polygonal chains consisting of two segments and with all three vertices on the lattice points of an n X n grid.

Original entry on oeis.org

0, 2, 19, 76, 215, 481, 946, 1691, 2789, 4356, 6525, 9397, 13128, 17874, 23768, 31071, 39953, 50551, 63141, 77947, 95234, 115223, 138305, 164501, 194344, 228218, 266165, 308688, 356104, 408731, 467166, 531616, 602362, 679952, 764821, 857517

Offset: 0

Alec Jones, Apr 18 2016

nonn

The chains are counted up to congruence.
Proof that a(n) = 3*A190313(n) + 2*A189978(n):
Let ABC be a lattice triangle in an n X n grid. If ABC is scalene, then the pairs (BA,AC), (AB,BC), and (AC, CB) form three inequivalent polygonal chains; likewise, if ABC is isosceles and AB is the base of the triangle, then (BA,AC) and (AC,CB) form two distinct polygonal chains, while (BC,CA) is congruent to (AB,BC).
Now consider an arbitrary 2-segment polygonal chain (XY,YZ). By the side-angle-side criterion for triangle congruence, the triangle to which XY and YZ belong is determined up to congruence, and so the proposed formula does not over-count. Thus a(n) = 3*A190313(n) + 2*A189978(n).

Alec Jones, Examples for n = 1 to 2

Cf. A190313, A189978.

a(n) = 3*A190313(n) + 2*A189978(n).

cp's OEIS Frontend

A028419 Congruence classes of triangles which can be drawn using lattice points in n X n grid as vertices.

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Extensions

A241236 Number of scalene triangles, distinct up to congruence, on a centered hexagonal grid of size n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

Extensions

A272053 a(n) is the number of equivalence classes of simple, open polygonal chains consisting of two segments and with all three vertices on the lattice points of an n X n grid.

Views

Author

Keywords

Comments

Links

Crossrefs

Formula