OFFSET
1,9
LINKS
Andrew Howroyd, Table of n, a(n) for n = 1..1000
Wikipedia, Integer Triangle
Index entries for linear recurrences with constant coefficients, signature (0,0,0,1,0,1,0,1,0,-1,0,-1,0,-1,0,0,0,1).
FORMULA
a(n) = Sum_{k=1..floor(n/3)} Sum_{i=k..floor((n-k)/2)} sign(floor((i+k)/(n-i-k+1))) * (1 - (i mod 2) * (k mod 2) * ((n-i-k) mod 2)).
G.f.: x^5*(1 + x + x^2 + x^3 + x^4 + x^5 + x^7)/((1 - x)^3*(1 + x)^3*(1 - x + x^2)*(1 + x^2)^2*(1 + x + x^2)*(1 + x^4)). - Andrew Howroyd, Nov 06 2025
a(n) = a(n-4) + a(n-6) + a(n-8) - a(n-10) - a(n-12) - a(n-14) + a(n-18). - Wesley Ivan Hurt, Nov 29 2025
MATHEMATICA
Table[Sum[Sum[(1 - Mod[i, 2] Mod[k, 2] Mod[n - i - k, 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 19 2019
STATUS
approved
