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

20, 20, 10, 6, 5, 20, 20, 10, 6, 5, 20, 20, 10, 6, 5, 20, 20, 10, 6, 5, 20, 20, 10, 6, 5, 20, 20, 10, 6, 5, 20, 20, 10, 6, 5, 20, 20, 10, 6, 5, 20, 20, 10, 6, 5, 20, 20, 10, 6, 5, 20, 20, 10, 6, 5, 20, 20, 10, 6, 5, 20, 20, 10, 6, 5, 20, 20, 10, 6, 5

Offset: 2

Author

N. J. A. Sloane, Oct 07 2012

Keywords

• nonn
• easy

Comments

Ultimately periodic with period length 5.

Links

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

Programs

Magma

&cat[[20, 20, 10, 6, 5]: n in [0..30]]; // Vincenzo Librandi, Nov 18 2012

Mathematica

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

Formula

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