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

7, 8, 5, 4, 9, 8, 5, 4, 9, 8, 5, 4, 9, 8, 5, 4, 9, 8, 5, 4, 9, 8, 5, 4, 9, 8, 5, 4, 9, 8, 5, 4, 9, 8, 5, 4, 9, 8, 5, 4, 9, 8, 5, 4, 9, 8, 5, 4, 9, 8, 5, 4, 9, 8, 5, 4, 9, 8, 5, 4, 9, 8, 5, 4, 9, 8, 5, 4, 9, 8, 5, 4, 9, 8, 5, 4, 9, 8, 5, 4, 9, 8, 5, 4, 9, 8, 5, 4, 9, 8, 5, 4, 9

Offset: 2

Author

N. J. A. Sloane, Oct 07 2012

Keywords

• nonn

Links

• Klaus Sutner and Sam Tetruashvili, Inferring automatic sequences.

Programs

Magma

[7] cat &cat[[8, 5, 4, 9]: n in [0..30]]; // Vincenzo Librandi, Nov 18 2012

Mathematica

Join[{7}, CoefficientList[Series[(8 + 5*x + 4*x^2 + 9x^3)/((1 - x^4)), {x, 0, 30}], x]] (* Vincenzo Librandi, Nov 18 2012 *)

Formula

Ultimately periodic with period length 4.

G.f.: x^2*(7 + 8*x + 5*x^2 + 4*x^3 + 2*x^4)/(1 - x^4). - Vincenzo Librandi, Nov 19 2012

Extensions

Terms corrected by Vincenzo Librandi, Nov 18 2012