login
a(n) is the total number of isosceles triangles having a bounding box n X k where k is in the range 1 to n inclusive.
3

%I #13 Feb 19 2017 13:54:50

%S 0,4,14,22,36,48,58,66,104,100,110,118,164,148,174,174,232,200,266,

%T 226,300,272,290,282,412,332,362,358,440,376,494,386,572,464,490,490,

%U 660,476,546,562,756,552,718,582,760,692,682,634,1004,716,862,746,900,744

%N a(n) is the total number of isosceles triangles having a bounding box n X k where k is in the range 1 to n inclusive.

%C Row sums of A279413.

%H Lars Blomberg, <a href="/A279414/b279414.txt">Table of n, a(n) for n = 1..10000</a>

%Y Cf. A186434, A187452, A271910-A271913, A271915, A279413.

%K nonn

%O 1,2

%A _Lars Blomberg_, Feb 16 2017