|
|
A211310
|
|
a(n) = number |fdw(P,(n))| of entangled P-words with s=3.
|
|
0
|
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
See Jenca and Sarkoci for the precise definition.
|
|
LINKS
|
|
|
FORMULA
|
From Peter Bala, Sep 05 2012: (Start)
Conjectural e.g.f.: 2 - 1/A(x), where A(x) = sum {n = 0..inf} (3*n)!/6^n*x^n/n! is the e.g.f. for A014606 (also the o.g.f. for A025035).
If true, this leads to the recurrence equation: a(n) = (3*n)!/6^n - sum {k = 1..n-1} (3*k)!/6^k*binomial(n,k)*a(n-k) with a(1) = 1.
(End)
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|