OFFSET
1,2
COMMENTS
It is conjectured that a(n) is never less than 0 (tested to n=2000)
EXAMPLE
The formula produces the initial output:
x, -2*x + 3, -x + 3, x + 1, -x + 5, 2*x, -x + 7, 4, 6, 2*x + 2, -x + 11, -x + 5, -x + 13, 2*x + 4, x + 7, 8, -x + 17, 6, -x + 19, -x + 9, x + 11, 2*x + 8, -x + 23, 8, 20, 2*x + 10, 18, -x + 13, -x + 29, -2*x + 10, -x + 31, 16, x + 19.
The sequence gives the constant term.
PROG
(PARI) s=vector(200); t(n)=binomial(n+1, 2); s[1]=x; for(i=2, 200, s[i]=t(i)-sum(j=1, i-1, s[j]*floor(i/j))); for(i=1, 200, print1(", "polcoeff(s[i], 0)))
CROSSREFS
KEYWORD
nonn
AUTHOR
Jon Perry, Mar 02 2004
STATUS
approved