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”).

A091188
G.f. A(x) satisfies both A(-x)*A(x) = A(x^2) and xA(x)^2 = B(xA(x^2)) where B(x) = x*(1+x)/(1-x).
3
1, 1, 1, 2, 2, 4, 5, 10, 12, 23, 31, 58, 79, 145, 207, 374, 540, 964, 1427, 2522, 3775, 6626, 10050, 17532, 26811, 46561, 71795, 124188, 192661, 332228, 518303, 891340, 1396902, 2396912, 3771822, 6459202, 10199912, 17437727, 27622807, 47152952
OFFSET
0,4
COMMENTS
This is a special case of sequences with g.f.s that satisfy the more general functional equation xA(x)^m = B(xA(x^m)) originated by Michael Somos; some other examples are A085748, A091190 and A091200.
FORMULA
Given g.f. A(x), then B(x) = x * A(x^2) satisfies 0 = f(B(x), B(x^2)) were f(u, v) = u^2 * (1 - v) - v * (1 + v). - Michael Somos, Aug 02 2011
EXAMPLE
1 + x + x^2 + 2*x^3 + 2*x^4 + 4*x^5 + 5*x^6 + 10*x^7 + 12*x^8 + 23*x^9 + ...
q + q^3 + q^5 + 2*q^7 + 2*q^9 + 4*q^11 + 5*q^13 + 10*q^15 + 12*q^17 + ...
PROG
(PARI) {a(n) = local(A, m); if( n<0, 0, m=1; A = 1 + O(x); while( m<=n, m*=2; A = x * subst(A, x, x^2); A = (A *(1 + A) /(1 - A) / x)^(1/2)); polcoeff(A, n))}
CROSSREFS
KEYWORD
nonn
AUTHOR
Paul D. Hanna, Feb 22 2004
STATUS
approved