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

Author

N. J. A. Sloane, Oct 07 2012

Keywords

• nonn
• easy

Links

• Klaus Sutner and Sam Tetruashvili, Inferring automatic sequences.
• Index entries for linear recurrences with constant coefficients, signature (0,0,1).

Programs

Magma

&cat[[6, 4, 3]: n in [0..30]]; // 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 *)

Formula

Periodic with period length 3.

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

Extensions

Terms corrected by Vincenzo Librandi, Nov 18 2012