login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A354698 T(n,k) is the number of points with integer coordinates strictly inside the triangle with vertices (0,0), (n,0), (n,k), where T(n,k) is a triangle read by rows, 2 <= k <= n. 0

%I #16 Jun 08 2022 10:16:18

%S 0,1,1,1,3,3,2,4,6,6,2,4,7,10,10,3,6,9,12,15,15,3,7,9,14,17,21,21,4,7,

%T 12,16,19,24,28,28,4,9,13,16,22,27,31,36,36,5,10,15,20,25,30,35,40,45,

%U 45,5,10,15,22,25,33,37,43,49,55,55,6,12,18,24,30,36,42,48,54,60,66,66

%N T(n,k) is the number of points with integer coordinates strictly inside the triangle with vertices (0,0), (n,0), (n,k), where T(n,k) is a triangle read by rows, 2 <= k <= n.

%C T(n,n) = T(n,n-1) because all grid points with m = n lie on a side of the triangle and thus not strictly inside.

%e The triangle begins:

%e 0;

%e 1, 1;

%e 1, 3, 3;

%e 2, 4, 6, 6;

%e 2, 4, 7, 10, 10;

%e 3, 6, 9, 12, 15, 15;

%e 3, 7, 9, 14, 17, 21, 21;

%e 4, 7, 12, 16, 19, 24, 28, 28;

%e 4, 9, 13, 16, 22, 27, 31, 36, 36;

%e 5, 10, 15, 20, 25, 30, 35, 40, 45, 45;

%e 5, 10, 15, 22, 25, 33, 37, 43, 49, 55, 55

%o (PARI) T(n, m) = sum(i=1, n-1, sum(j=1, m-1, (i/j > n/m))); \\ _Michel Marcus_, Jun 07 2022

%Y Cf. A000217 (right diagonal), A074148 (3rd diagonal).

%Y Cf. A004526 (column 2), A117571 (column 3).

%K nonn,tabl,easy

%O 2,5

%A _Hugo Pfoertner_, Jun 06 2022

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 17 05:28 EDT 2024. Contains 375985 sequences. (Running on oeis4.)