A217517 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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

(list; graph; refs; listen; history; text; internal format)

OFFSET

2,1

COMMENTS

Ultimately periodic with period length 5.

LINKS

Table of n, a(n) for n=2..71.

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).

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

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

PROG

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

CROSSREFS

Sequence in context: A205545 A087708 A220022 * A332561 A278831 A081245

Adjacent sequences: A217514 A217515 A217516 * A217518 A217519 A217520

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane, Oct 07 2012

STATUS

approved