A217517 - OEIS

%I #16 Sep 08 2022 08:46:04

%S 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,

%T 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,

%U 10,6,5,20,20,10,6,5,20,20,10,6,5,20,20,10,6,5

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

%C Ultimately periodic with period length 5.

%H Klaus Sutner and Sam Tetruashvili, <a href="http://www.cs.cmu.edu/~sutner/papers/auto-seq.pdf ">Inferring automatic sequences</a>, p. 5 (Table 1).

%H <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,0,0,1).

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

%t 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 *)

%o (Magma) &cat[[20, 20, 10, 6, 5]: n in [0..30]]; // _Vincenzo Librandi_, Nov 18 2012

%K nonn,easy

%O 2,1

%A _N. J. A. Sloane_, Oct 07 2012