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!)
A309509 G.f. satisfies A(A(x)) = F(x), where F(x) is the g.f. for A001787(n) = n*2^(n-1). 0
0, 1, 2, 2, 2, 2, 0, 4, 6, -58, 100, 1052, -5924, -21972, 322020, 332392, -21168682, 29068598, 1724404180, -7070346036, -172304798980, 1290100381724, 20728501384592, -247269172883976, -2936888518668676, 53037176259027580, 477640220538178184 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
A(x) is sometimes called a functional square root, or half-iterate of F(x).
LINKS
Dmitry Kruchinin, Vladimir Kruchinin, Method for solving an iterative functional equation $A^{2^n}(x)=F(x)$, arXiv:1302.1986 [math.CO], 2013.
MATHEMATICA
half[q_] := half[q] = Module[{h}, h[0] = 0; h[1] = 1; h[n_Integer] := h[n] = Module[{c}, c[m_Integer /; m < n] := h[m]; c[n] /. Solve[q[n] == Sum[k! c[k] BellY[n, k, Table[m! c[m], {m, n - k + 1}]], {k, n}]/n!, c[n]][[1]]]; h]; a[n_Integer] := a[n] = half[Function[k, k 2^(k-1)]][n]; Table[a[n], {n, 0, 26}]
CROSSREFS
Sequence in context: A159782 A268242 A362932 * A216953 A326786 A276206
KEYWORD
sign
AUTHOR
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 April 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)