A217515 Base-n state complexity of partitioned deterministic finite automaton (PDFA) for the periodic sequence (123)*.

6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6

Offset

2,1

Links

Table of n, a(n) for n=2..92.

Klaus Sutner and Sam Tetruashvili, Inferring automatic sequences.

Index entries for linear recurrences with constant coefficients, signature (0,0,1).

Formula

Periodic with period length 3.

G.f.: x^2*(6 + 4*x + 3*x^2)/((1 - x^3)). - Vincenzo Librandi, Nov 18 2012

Mathematica

CoefficientList[Series[(6 + 4*x + 3*x^2)/((1 - x^3)), {x, 0, 40}], x] (* Vincenzo Librandi, Nov 18 2012 *)

Prog

(Magma) &cat[[6, 4, 3]: n in [0..30]]; // Vincenzo Librandi, Nov 18 2012

Crossrefs

Sequence in context: A224927 A200104 A154747 * A354619 A079624 A035335

Adjacent sequences: A217512 A217513 A217514 * A217516 A217517 A217518

Keyword

nonn,easy

Author

N. J. A. Sloane, Oct 07 2012

Extensions

Terms corrected by Vincenzo Librandi, Nov 18 2012

Status

approved