OFFSET
1,2
COMMENTS
The radius of convergence r of g.f. A(x) solves r*(1+r)^5 = 1 where r = 0.2851990332453493679...
LINKS
Paul D. Hanna, Table of n, a(n) for n = 1..500
FORMULA
G.f. A(x) = Sum_{n>=1} a(n)*x^n satisfies:
(1) A(x) = A( x^2*(1+x)^5 ) / x.
(2) R(x*A(x)) = x^2*(1+x)^5, where R(A(x)) = x.
(3) A(x) = x * Product_{n>=1} F(n)^5, where F(1) = 1+x, and F(n+1) = 1 + (F(n) - 1)^2 * F(n)^5 for n >= 1.
(4) A(x) = B(x)^5/x^4 where B(x) is the g.f. of A369548.
EXAMPLE
G.f.: A(x) = x + 5*x^2 + 15*x^3 + 60*x^4 + 245*x^5 + 826*x^6 + 2685*x^7 + 9285*x^8 + 33170*x^9 + 120170*x^10 + 440326*x^11 + ...
RELATED SERIES.
(x^4*A(x))^(1/5) = x + x^2 + x^3 + 6*x^4 + 16*x^5 + 31*x^6 + 76*x^7 + 267*x^8 + 1067*x^9 + 4158*x^10 + ... + A369548(n)*x^n + ...
Let R(x) be the series reversion of A(x),
R(x) = x - 5*x^2 + 35*x^3 - 310*x^4 + 3105*x^5 - 33201*x^6 + 370405*x^7 - 4263900*x^8 + 50282555*x^9 - 604351325*x^10 + ...
then R(x) and g.f. A(x) satisfy:
(1) R(A(x)) = x,
(2) R(x*A(x)) = x^2*(1 + x)^5.
GENERATING METHOD.
Define F(n), a polynomial in x of order 7^(n-1), by the following recurrence:
F(1) = (1 + x),
F(2) = (1 + x^2 * (1+x)^5),
F(3) = (1 + x^4 * (1+x)^10 * F(2)^5),
F(4) = (1 + x^8 * (1+x)^20 * F(2)^10 * F(3)^5),
F(5) = (1 + x^16 * (1+x)^40 * F(2)^20 * F(3)^10 * F(4)^5),
...
F(n+1) = 1 + (F(n) - 1)^2 * F(n)^5
...
Then the g.f. A(x) equals the infinite product:
A(x) = x * F(1)^5 * F(2)^5 * F(3)^5 * ... * F(n)^5 * ...
PROG
(PARI) {a(n) = my(A=[1], F); for(i=1, n, A=concat(A, 0); F=x*Ser(A); A[#A] = polcoeff( subst(F, x, x^2*(1 + x)^5 ) - x*F , #A+1) ); A[n]}
for(n=1, 35, print1(a(n), ", "))
CROSSREFS
KEYWORD
nonn
AUTHOR
Paul D. Hanna, Jan 25 2024
STATUS
approved