OFFSET
1,9
LINKS
Wikipedia, Integer Triangle
FORMULA
a(n) = Sum_{k=1..floor(n/3)} Sum_{i=k..floor((n-k)/2)} sign(floor((i+k)/(n-i-k+1))) * ((n-i-k-1) mod 2).
Conjectures from Colin Barker, May 11 2019: (Start)
G.f.: x^5 / ((1 - x)^3*(1 + x)^2*(1 - x + x^2)*(1 + x^2)^2*(1 + x + x^2)).
a(n) = a(n-1) - a(n-2) + a(n-3) + a(n-4) - a(n-5) + 2*a(n-6) - 2*a(n-7) + a(n-8) - a(n-9) - a(n-10) + a(n-11) - a(n-12) + a(n-13) for n>13.
(End)
MATHEMATICA
Table[Sum[Sum[Mod[n - i - k - 1, 2]*Sign[Floor[(i + k)/(n - i - k + 1)]], {i, k, Floor[(n - k)/2]}], {k, Floor[n/3]}], {n, 100}]
CROSSREFS
KEYWORD
nonn
AUTHOR
Wesley Ivan Hurt, May 10 2019
STATUS
approved