Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #24 Oct 13 2022 12:11:27
%S 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,
%T 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,
%U 3,6,4,3,6,4,3,6,4,3,6,4,3,6,4,3,6,4,3,6,4,3,6
%N Base-n state complexity of partitioned deterministic finite automaton (PDFA) for the periodic sequence (123)*.
%H Klaus Sutner and Sam Tetruashvili, <a href="http://www.cs.cmu.edu/~sutner/papers/auto-seq.pdf">Inferring automatic sequences</a>.
%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (0,0,1).
%F Periodic with period length 3.
%F G.f.: x^2*(6 + 4*x + 3*x^2)/((1 - x^3)). - _Vincenzo Librandi_, Nov 18 2012
%t CoefficientList[Series[(6 + 4*x + 3*x^2)/((1 - x^3)),{x, 0, 40}], x] (* _Vincenzo Librandi_, Nov 18 2012 *)
%o (Magma) &cat[[6, 4, 3]: n in [0..30]]; // _Vincenzo Librandi_, Nov 18 2012
%K nonn,easy
%O 2,1
%A _N. J. A. Sloane_, Oct 07 2012
%E Terms corrected by _Vincenzo Librandi_, Nov 18 2012