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

 

Logo

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 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A349286 G.f. A(x) satisfies: A(x) = 1 / (1 - x * A(3*x)^2). 1
1, 1, 7, 148, 8695, 1455433, 715092412, 1046279830240, 4581706851060703, 60144130721142806611, 2367934845363738749478583, 279660212608573899258160179472, 99083333806943049370375436233999876, 105314387436569180750449877597844106742044 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
FORMULA
a(0) = 1; a(n) = Sum_{i=0..n-1} Sum_{j=0..n-i-1} 3^(i+j) * a(i) * a(j) * a(n-i-j-1).
a(n) ~ c * 3^(n*(n-1)/2) * 2^n, where c = 0.7827821536020754599551185976017878354967268590673601224489106938395... - Vaclav Kotesovec, Nov 13 2021
MATHEMATICA
nmax = 13; A[_] = 0; Do[A[x_] = 1/(1 - x A[3 x]^2) + O[x]^(nmax + 1) // Normal, nmax + 1]; CoefficientList[A[x], x]
a[0] = 1; a[n_] := a[n] = Sum[Sum[3^(i + j) a[i] a[j] a[n - i - j - 1], {j, 0, n - i - 1}], {i, 0, n - 1}]; Table[a[n], {n, 0, 13}]
CROSSREFS
Sequence in context: A048935 A291677 A152552 * A308581 A305467 A229806
KEYWORD
nonn
AUTHOR
Ilya Gutkovskiy, Nov 13 2021
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 December 4 22:39 EST 2023. Contains 367565 sequences. (Running on oeis4.)