login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A122940 L.g.f.: A(x) satisfies: A(x+x^2) = 2*A(x) - log(1+x) with A(0)=0; thus A(x) = log(B(x)), where B(x) is g.f. of A122938. 2
1, 1, 4, 17, 106, 796, 7176, 75057, 894100, 11946906, 176939192, 2876683340, 50931297912, 975391344376, 20090039762944, 442830738561585, 10400937450758286, 259318357362882148, 6839990934297006668 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
a(n) = n * Sum_{k=0..n-1} (-1)^(n-k-1)*A122941(n-k,k)/(n-k).
LINKS
FORMULA
L.g.f.: A(x) = Sum_{n>=1} a(n)*x^n/n = Sum_{n>=0} log(1 + F_n(x))/2^(n+1) where F_0(x)=x, F_{n+1}(x) = F_n(x+x^2); a sum involving self-compositions of x+x^2 (cf. A122888).
EXAMPLE
To illustrate A(x+x^2) = 2*A(x) - log(1+x):
A(x) = x + 1*x^2/2 + 4*x^3/3 + 17*x^4/4 + 106*x^5/5 + 796*x^6/6 +...
A(x+x^2) = x + 3*x^2/2 + 7*x^3/3 + 35*x^4/4 + 211*x^5/5 + 1593*x^6/6 +...
PROG
(PARI) {a(n)=local(A=x+x*O(x^n)); for(i=0, n, A=-A+subst(A, x, x+x^2)+log(1+x+x*O(x^n))); n*polcoeff(A, n)}
CROSSREFS
Cf. A122938; related tables: A122941, A122888.
Sequence in context: A127676 A335626 A232211 * A077386 A209903 A330514
KEYWORD
nonn
AUTHOR
Paul D. Hanna, Sep 25 2006
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 05:39 EDT 2024. Contains 371235 sequences. (Running on oeis4.)