|
EXAMPLE
|
G.f.: A(x) = 1 + x + 2*x^2 + 20*x^3 + 282*x^4 + 5134*x^5 + 112053*x^6 + 2823119*x^7 + 80202565*x^8 + 2529045393*x^9 + 87523776013*x^10 + ...
such that
0 = ((1+x) - A(x)) + 2*((1+x)^2 - A(x))^2 + 3*((1+x)^3 - A(x))^3 + 4*((1+x)^4 - A(x))^4 + 5*((1+x)^5 - A(x))^5 + 6*((1+x)^6 - A(x))^6 + ...
The terms a(n) modulo 2 begin:
1,1,0,0,0,0,1,1,1,1,1,1,0,0,0,0,0,0,1,1,1,1,1,1,
0,0,1,1,1,1,0,0,0,0,1,1,1,1,0,0,1,1,1,1,1,1,0,0,
0,0,0,0,0,0,1,1,0,0,1,1,0,0,1,1,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,1,1,1,1,
0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,0,1,1,1,1,
1,1,1,1,0,0,0,0,1,1,0,0,1,1,0,0,1,1,1,1,0,0,1,1,
0,0,0,0,1,1,1,1,0,0,1,1,1,1,1,1,0,0,1,1,1,1,0,0,
1,1,0,0,0,0,1,1,1,1,0,0,0,0,1,1,1,1,0,0,0,0,0,0,
1,1,0,0,0,0,0,0,0, ...
|