A279432 -id:A279432 - cp's OEIS frontend

A279413 Triangle read by rows: T(n,k), n>=k>=1, is the number of isosceles triangles with integer coordinates that have a bounding box of size n X k.

0, 0, 4, 0, 2, 12, 0, 0, 6, 16, 0, 2, 4, 6, 24, 0, 0, 2, 8, 10, 28, 0, 2, 4, 2, 8, 6, 36, 0, 0, 2, 0, 6, 8, 10, 40, 0, 2, 4, 2, 12, 10, 8, 10, 56, 0, 0, 2, 4, 2, 4, 10, 8, 10, 60, 0, 2, 4, 2, 4, 2, 12, 6, 12, 6, 60, 0, 0, 2, 0, 2, 4, 6, 12, 6, 8, 14, 64, 0, 2

Offset: 1

Lars Blomberg, Feb 16 2017

			Triangle begins:
0
0, 4
0, 2, 12
0, 0, 6, 16
0, 2, 4, 6, 24
0, 0, 2, 8, 10, 28
0, 2, 4, 2, 8, 6, 36
0, 0, 2, 0, 6, 8, 10, 40
0, 2, 4, 2, 12, 10, 8, 10, 56
0, 0, 2, 4, 2, 4, 10, 8, 10, 60
0, 2, 4, 2, 4, 2, 12, 6, 12, 6, 60
0, 0, 2, 0, 2, 4, 6, 12, 6, 8, 14, 64
0, 2, 4, 2, 4, 6, 8, 10, 16, 14, 12, 14, 72
0, 0, 2, 0, 2, 4, 2, 8, 14, 4, 6, 12, 18, 76
0, 2, 4, 2, 4, 2, 8, 2, 8, 10, 16, 10, 12, 10, 84
0, 0, 2, 0, 6, 4, 2, 4, 6, 16, 6, 4, 10, 12, 14, 88
0, 2, 4, 2, 4, 2, 8, 2, 16, 6, 16, 10, 16, 6, 24, 10, 104
0, 0, 2, 0, 2, 0, 2, 4, 6, 4, 10, 12, 10, 12, 10, 12, 14, 100
0, 2, 4, 2, 4, 2, 12, 6, 4, 6, 12, 10, 20, 6, 12, 14, 16, 10, 124
0, 0, 2, 0, 2, 0, 2, 0, 2, 4, 6, 12, 10, 12, 10, 12, 18, 12, 10, 112
-----
Denote by 'o' the point adjacent to the two equal sides, and by 'x' the other two.
n=4, k=3:
...x  x...  .o..  ..o.  x...  ...x
o...  ...o  ...x  x...  ...x  x...
...x  x...  x...  ...x  .o..  ..o.
So T(4,3)=6.
-----
n=4,k=4:
o...  ...o  .x..  ..x.  o...  ...o  ..x.  .x..
...x  x...  ....  ....  ....  ....  ...x  x...
....  ....  ...x  x...  ...x  x...  ....  ....
.x..  ..x.  o...  ...o  ..x.  .x..  o...  ...o
-
...x  x...  x...  ...x  o..x  x..o  x...  ...x
.o..  ..o.  ....  ....  ....  ....  ....  ....
....  ....  .o..  ..o.  ....  ....  ....  ....
x...  ...x  ...x  x...  x...  ...x  o..x  x..o
So T(4,4)=16.

Lars Blomberg, Table of n, a(n) for n = 1..9870 (the first 140 rows)
Lars Blomberg, Algorithms for computing A279413, A279414, A186434 and A271908

Cf. A186434, A187452, A271910-A271913, A271915, A279414.
See A279415 for right isosceles triangles.
See A280639 for obtuse isosceles triangles.
See A279418 for acute isosceles triangles.
See A279433 for all right triangles.
See A280652 for all obtuse triangles.
See A280653 for all acute triangles.
See A279432 for all triangles.

A279418 Triangle read by rows: T(n,k), n>=k>=1, is the number of acute isosceles triangles with integer coordinates that have a bounding box of size n X k.

Original entry on oeis.org

0, 0, 0, 0, 0, 8, 0, 0, 2, 8, 0, 0, 2, 2, 16, 0, 0, 2, 4, 6, 16, 0, 0, 2, 0, 4, 2, 24, 0, 0, 2, 0, 2, 4, 6, 24, 0, 0, 2, 0, 6, 6, 4, 6, 40, 0, 0, 2, 0, 2, 0, 6, 4, 6, 40, 0, 0, 2, 0, 2, 0, 8, 2, 8, 2, 40, 0, 0, 2, 0, 2, 4, 2, 8, 2, 4, 10, 40, 0, 0, 2, 0, 2, 0

Offset: 1

Lars Blomberg, Feb 27 2017

			Triangle begins:
0
0,0
0,0,8
0,0,2,8
0,0,2,2,16
0,0,2,4,6,16
0,0,2,0,4,2,24
0,0,2,0,2,4,6,24
0,0,2,0,6,6,4,6,40
0,0,2,0,2,0,6,4,6,40
0,0,2,0,2,0,8,2,8,2,40
0,0,2,0,2,4,2,8,2,4,10,40
0,0,2,0,2,0,2,2,8,10,8,10,48
0,0,2,0,2,4,2,4,10,0,2,8,14,48
0,0,2,0,2,0,6,0,4,6,12,6,8,6,56
0,0,2,0,2,0,2,0,2,8,2,0,6,8,10,56
------
The vertex between the two equal sides is 'o'.
For n=3, k=3:
x.x   x..   o..   .x.   .x.   .o.   ..o   ..x
...   ..o   ..x   x..   ..x   ...   x..   o..
.o.   x..   .x.   ..o   o..   x.x   .x.   ..x
So T(3,3)=8
------
For n=6, k=4:
x....o   o....x   .x....   ....x.
......   ......   ......   ......
......   ......   ......   ......
.x....   ....x.   x....o   o....x
So T(6,4)=4

Lars Blomberg, Table of n, a(n) for n = 1..9870 (the first 140 rows)

Cf. A190317.
See A279415 for right isosceles triangles.
See A280639 for obtuse isosceles triangles.
See A279413 for all isosceles triangles.
See A279433 for all right triangles.
See A280652 for all obtuse triangles.
See A280653 for all acute triangles.
See A279432 for all triangles.

A279433 Triangle read by rows: T(n,k), n>=k>=1, is the number of right triangles with integral coordinates that have a bounding box of size n X k.

Original entry on oeis.org

0, 0, 4, 0, 6, 4, 0, 4, 12, 4, 0, 4, 6, 12, 12, 0, 4, 8, 12, 12, 4, 0, 4, 4, 6, 12, 20, 4, 0, 4, 4, 12, 12, 12, 20, 4, 0, 4, 4, 4, 14, 12, 20, 12, 12, 0, 4, 4, 4, 12, 12, 16, 12, 12, 20, 0, 4, 4, 8, 8, 6, 12, 20, 20, 20, 4, 0, 4, 4, 4, 4, 12, 28, 12, 12, 12

Offset: 1

Lars Blomberg, Feb 27 2017

			Triangle begins:
0
0,4
0,6,4
0,4,12,4
0,4,6,12,12
0,4,8,12,12,4
0,4,4,6,12,20,4
0,4,4,12,12,12,20,4
0,4,4,4,14,12,20,12,12
0,4,4,4,12,12,16,12,12,20
0,4,4,8,8,6,12,20,20,20,4
0,4,4,4,4,12,28,12,12,12,20,4
0,4,4,4,4,12,6,20,20,16,20,20,12
0,4,4,4,12,4,24,12,12,12,20,12,20,4
0,4,4,4,4,4,12,6,28,20,12,20,20,20,4
0,4,4,4,4,4,8,12,20,20,12,20,12,20,28,4
0,4,4,4,4,12,4,12,18,12,20,12,28,12,20,20,28
-----
The right angle is 'o'.
For n=2, k=2:
ox   xo   x.   .x
x.   .x   ox   xo
So T(2,2)=4
-----
For n=3, k=2:
o.x   x.x   x.o   x..   .o.   ..x
x..   .o.   ..x   o.x   x.x   x.o
So T(3,2)=6

Lars Blomberg, Table of n, a(n) for n = 1..9870 (the first 140 rows)

Cf. A077435.
See A279415 for right isosceles triangles.
See A280639 for obtuse isosceles triangles.
See A279418 for acute isosceles triangles.
See A279413 for all isosceles triangles.
See A280652 for all obtuse triangles.
See A280653 for all acute triangles.
See A279432 for all triangles.

A280639 Triangle read by rows: T(n,k), n>=k>=1, is the number of obtuse isosceles triangles with integral coordinates that have a bounding box of size n X k.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 4, 0, 2, 0, 0, 4, 0, 0, 0, 0, 0, 8, 0, 2, 2, 0, 0, 0, 8, 0, 0, 0, 0, 0, 0, 0, 12, 0, 2, 2, 2, 4, 0, 0, 0, 12, 0, 0, 0, 4, 0, 0, 0, 0, 0, 16, 0, 2, 2, 2, 2, 0, 0, 0, 0, 0, 16, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 20, 0, 2, 2, 2, 2, 6, 4

Offset: 1

Lars Blomberg, Feb 27 2017

			Triangle begins:
0
0,0
0,0,0
0,0,0,4
0,2,0,0,4
0,0,0,0,0,8
0,2,2,0,0,0,8
0,0,0,0,0,0,0,12
0,2,2,2,4,0,0,0,12
0,0,0,4,0,0,0,0,0,16
0,2,2,2,2,0,0,0,0,0,16
0,0,0,0,0,0,0,0,0,0,0,20
0,2,2,2,2,6,4,4,4,0,0,0,20
-------
The obtuse angle is 'o'.
For n=4, k=4:
x...   x...   ...x   ...x
..o.   ....   .o..   ....
....   .o..   ....   ..o.
...x   ...x   x...   x...
So T(4,4)=4
-------
For n=5, k=2:
x...x   ..o..
..o..   x...x
So T(5,2)=2

Lars Blomberg, Table of n, a(n) for n = 1..9870 (the first 140 rows)

Cf. A190318.
See A279415 for right isosceles triangles.
See A279418 for acute isosceles triangles.
See A279413 for all isosceles triangles.
See A279433 for all right triangles.
See A280652 for all obtuse triangles.
See A280653 for all acute triangles.
See A279432 for all triangles.

A280652 Triangle read by rows: T(n,k), n>=k>=1, is the number of obtuse triangles with integer coordinates that have a bounding box of size n X k.

Original entry on oeis.org

0, 0, 0, 0, 4, 8, 0, 12, 16, 20, 0, 18, 32, 36, 36, 0, 24, 48, 56, 60, 72, 0, 30, 62, 76, 84, 88, 104, 0, 36, 76, 104, 112, 120, 132, 140, 0, 42, 86, 130, 136, 152, 160, 184, 180, 0, 48, 100, 144, 180, 184, 192, 216, 232, 240, 0, 54, 110, 166, 210, 228, 232

Offset: 1

Lars Blomberg, Feb 26 2017

			Triangle begins:
0
0,0
0,4,8
0,12,16,20
0,18,32,36,36
0,24,48,56,60,72
0,30,62,76,84,88,104
0,36,76,104,112,120,132,140
0,42,86,130,136,152,160,184,180
0,48,100,144,180,184,192,216,232,240
0,54,110,166,210,228,232,252,268,284,312
0,60,124,188,240,272,272,296,316,336,352,372
0,66,134,202,258,314,328,332,352,372,400,428,436
0,72,148,224,288,352,380,400,408,432,448,480,508,536
-----
The obtuse angle is 'o'.
For n=3, k=2:
xo.   x..   .ox   ..x
..x   .ox   x..   xo.
So T(3,2)=4
-----
For n=3, k=3:
xo.   x..   x..   x..   .ox   ..x   ..x   ..x
...   o..   ..o   ...   ...   o..   ..o   ...
..x   ..x   ..x   .ox   x..   x..   x..   xo.
So T(3,3)=8

Lars Blomberg, Table of n, a(n) for n = 1..9870 (the first 140 rows)

Cf. A190020.
See A279415 for right isosceles triangles.
See A280639 for obtuse isosceles triangles.
See A279418 for acute isosceles triangles.
See A279413 for all isosceles triangles.
See A279433 for all right triangles.
See A280653 for all acute triangles.
See A279432 for all triangles.

A280653 Triangle read by rows: T(n,k), n>=k>=1, is the number of acute triangles with integer coordinates that have a bounding box of size n X k.

Original entry on oeis.org

0, 0, 0, 0, 0, 8, 0, 0, 6, 24, 0, 0, 6, 22, 40, 0, 0, 2, 20, 46, 64, 0, 0, 2, 20, 44, 70, 96, 0, 0, 2, 8, 42, 76, 98, 136, 0, 0, 2, 8, 34, 74, 104, 138, 176, 0, 0, 2, 8, 22, 72, 110, 148, 186, 208, 0, 0, 2, 4, 18, 56, 112, 146, 188, 234, 264, 0, 0, 2, 4, 18

Offset: 1

Lars Blomberg, Feb 25 2017

It appears that the main diagonal is 8*A014811.

			Triangle begins:
0
0,0
0,0,8
0,0,6,24
0,0,6,22,40
0,0,2,20,46,64
0,0,2,20,44,70,96
0,0,2,8,42,76,98,136
0,0,2,8,34,74,104,138,176
0,0,2,8,22,72,110,148,186,208
0,0,2,4,18,56,112,146,188,234,264
0,0,2,4,18,44,94,152,198,244,286,328
0,0,2,4,18,32,86,150,196,254,296,342,392
-----
For n=3, k=3:
o.o   o..   o..   .o.   .o.   .o.   ..o   ..o
...   ..o   ..o   o..   ..o   ...   o..   o..
.o.   o..   .o.   ..o   o..   o.o   .o.   ..o
so T(3,3)=8
-----
For n=4, k=3:
o..o   o..o   o...   .o..   ..o.   ...o
....   ....   ...o   ....   ....   o...
.o..   ..o.   o...   o..o   o..o   ...o
so T(4,3)=6
-----
For n=6, k=3:
o.....   .....o
.....o   o.....
o.....   .....o
so T(6,3)=2

Lars Blomberg, Table of n, a(n) for n = 1..9870 (the first 140 rows)

Cf. A190019.
See A279415 for right isosceles triangles.
See A280639 for obtuse isosceles triangles.
See A279418 for acute isosceles triangles.
See A279413 for all isosceles triangles.
See A279433 for all right triangles.
See A280652 for all obtuse triangles.
See A279432 for all triangles.

A279415 Triangle read by rows: T(n,k), n>=k>=1, is the number of right isosceles triangles with integral coordinates that have a bounding box of size n X k.

Original entry on oeis.org

0, 0, 4, 0, 2, 4, 0, 0, 4, 4, 0, 0, 2, 4, 4, 0, 0, 0, 4, 4, 4, 0, 0, 0, 2, 4, 4, 4, 0, 0, 0, 0, 4, 4, 4, 4, 0, 0, 0, 0, 2, 4, 4, 4, 4, 0, 0, 0, 0, 0, 4, 4, 4, 4, 4, 0, 0, 0, 0, 0, 2, 4, 4, 4, 4, 4, 0, 0, 0, 0, 0, 0, 4, 4, 4, 4, 4, 4, 0, 0, 0, 0, 0, 0, 2, 4, 4

Offset: 1

Lars Blomberg, Feb 27 2017

			Triangle begins:
0
0,4
0,2,4
0,0,4,4
0,0,2,4,4
0,0,0,4,4,4
0,0,0,2,4,4,4
0,0,0,0,4,4,4,4
0,0,0,0,2,4,4,4,4
0,0,0,0,0,4,4,4,4,4
0,0,0,0,0,2,4,4,4,4,4
0,0,0,0,0,0,4,4,4,4,4,4
0,0,0,0,0,0,2,4,4,4,4,4,4
-------
The right angle is 'o'.
For n=4, k=3:
x...   .o..   ..o.   ...x
...x   ...x   x...   x...
.o..   x...   ...x   ..o.
So T(4,3)=4
-------
For n=4, k=4:
o..x   x..o   x...   ...x
....   ....   ....   ....
....   ....   ....   ....
x...   ...x   o..x   x..o
So T(4,4)=4

Lars Blomberg, Table of n, a(n) for n = 1..9870 (the first 140 rows)

Cf. A187452.
See A280639 for obtuse isosceles triangles.
See A279418 for acute isosceles triangles.
See A279413 for all isosceles triangles.
See A279433 for all right triangles.
See A280652 for all obtuse triangles.
See A280653 for all acute triangles.
See A279432 for all triangles.

cp's OEIS Frontend

A279413 Triangle read by rows: T(n,k), n>=k>=1, is the number of isosceles triangles with integer coordinates that have a bounding box of size n X k.

Views

Author

Keywords

Examples

Links

Crossrefs

A279418 Triangle read by rows: T(n,k), n>=k>=1, is the number of acute isosceles triangles with integer coordinates that have a bounding box of size n X k.

Views

Author

Keywords

Examples

Links

Crossrefs

A279433 Triangle read by rows: T(n,k), n>=k>=1, is the number of right triangles with integral coordinates that have a bounding box of size n X k.

Views

Author

Keywords

Examples

Links

Crossrefs

A280639 Triangle read by rows: T(n,k), n>=k>=1, is the number of obtuse isosceles triangles with integral coordinates that have a bounding box of size n X k.

Views

Author

Keywords

Examples

Links

Crossrefs

A280652 Triangle read by rows: T(n,k), n>=k>=1, is the number of obtuse triangles with integer coordinates that have a bounding box of size n X k.

Views

Author

Keywords

Examples

Links

Crossrefs

A280653 Triangle read by rows: T(n,k), n>=k>=1, is the number of acute triangles with integer coordinates that have a bounding box of size n X k.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

A279415 Triangle read by rows: T(n,k), n>=k>=1, is the number of right isosceles triangles with integral coordinates that have a bounding box of size n X k.

Views

Author

Keywords

Examples

Links

Crossrefs