OFFSET
1,2
LINKS
Paul D. Hanna, Table of n, a(n) for n = 1..300
FORMULA
G.f. A(x) satisfies:
(1) 1 = Sum_{n>=0} x^n * ((1 + 3*x)^n - A(x))^(n+1).
(2) 1 + x = Sum_{n>=0} x^n * (1 + 3*x)^(n*(n-1)) / (1 + x*(1 + 3*x)^n*A(x))^(n+1).
FORMULA FOR TERMS.
a(n) = (-1)^n (mod 3) for n >= 0.
EXAMPLE
G.f.: A(x) = x + 5*x^2 + 10*x^3 + 80*x^4 + 568*x^5 + 4220*x^6 + 38692*x^7 + 369602*x^8 + 3829789*x^9 + 42483419*x^10 + 498335248*x^11 + 6168187340*x^12 + ...
such that
1 = (1 - A(x)) + x*((1+3*x) - A(x))^2 + x^2*((1+3*x)^2 - A(x))^3 + x^3*((1+3*x)^3 - A(x))^4 + x^4*((1+3*x)^4 - A(x))^5 + x^5*((1+3*x)^5 - A(x))^6 + x^6*((1+3*x)^6 - A(x))^7 + ...
PROG
(PARI) {a(n) = my(A=[1]); for(i=1, n, A = concat(A, 0); A[#A] = polcoeff( sum(m=0, #A, x^m*((1 + 3*x +x*O(x^#A))^m - x*Ser(A))^(m+1) ), #A); ); A[n+1]}
for(n=0, 30, print1(a(n), ", "))
CROSSREFS
KEYWORD
nonn
AUTHOR
Paul D. Hanna, May 11 2019
STATUS
approved