1,1

Number of possible well-colored cycles on n nodes. Well-colored means, each green vertex has at least a red child, each red vertex has no red child.

Table of n, a(n) for n=1..17.

C. Banderier, J.-M. Le Bars and V. Ravelomanana, Generating functions for kernels of digraphs

E.g.f.: -log(1-2x-4x^2). Contrary to b(n) = 2^n*Fib(n), there seems to be no rational o.g.f. for the sequence.

Equals A000079(n) * A000204(n).

Sequence in context: A226226 A126737 A345697 * A076804 A190153 A334772

Adjacent sequences: A097629 A097630 A097631 * A097633 A097634 A097635

nonn

Ralf Stephan, Aug 17 2004

approved