login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A277305
G.f. satisfies: A(x - 5*A(x)^2) = x + A(x)^2.
13
1, 6, 132, 4350, 176964, 8235252, 421814232, 23252672574, 1359954622860, 83572511671092, 5359130778285096, 356786692299782916, 24565803644793789192, 1744056102774572824920, 127369971591949093219920, 9550397045409732902387790, 734084078724419876468356500, 57766855968717521513179054860, 4648888743682938087701732224680
OFFSET
1,2
LINKS
FORMULA
G.f. A(x) also satisfies:
(1) A(x) = x + 6 * A( x/6 + 5*A(x)/6 )^2.
(2) A(x) = -x/5 + 6/5 * Series_Reversion(x - 5*A(x)^2).
(3) R(x) = -5*x + 6 * Series_Reversion(x + A(x)^2), where R(A(x)) = x.
(4) R( sqrt( x/6 - R(x)/6 ) ) = 5*x/6 + R(x)/6, where R(A(x)) = x.
a(n) = Sum_{k=0..n-1} A277295(n,k) * 5^k * 6^(n-k-1).
EXAMPLE
G.f.: A(x) = x + 6*x^2 + 132*x^3 + 4350*x^4 + 176964*x^5 + 8235252*x^6 + 421814232*x^7 + 23252672574*x^8 + 1359954622860*x^9 + 83572511671092*x^10 +...
PROG
(PARI) {a(n) = my(A=[1], F=x); for(i=1, n, A=concat(A, 0); F=x*Ser(A); A[#A] = -polcoeff(subst(F, x, x - 5*F^2) - F^2, #A) ); A[n]}
for(n=1, 30, print1(a(n), ", "))
KEYWORD
nonn
AUTHOR
Paul D. Hanna, Oct 09 2016
STATUS
approved