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

41, 40, 21, 11, 11, 40, 41, 20, 11, 10, 41, 40, 21, 11, 11, 40, 41, 20, 11, 10, 41, 40, 21, 11, 11, 40, 41, 20, 11, 10, 41, 40, 21, 11, 11, 40, 41, 20, 11, 10, 41, 40, 21, 11, 11, 40, 41, 20, 11, 10, 41, 40, 21, 11, 11, 40, 41, 20, 11, 10, 41, 40, 21, 11, 11, 40

Offset: 2

Author

Vincenzo Librandi, Sep 16 2014

Keywords

• nonn
• easy

Links

• Klaus Sutner and Sam Tetruashvili, Inferring automatic sequences (see table on the p. 5).

Crossrefs

Cf. A176059, A217515 - A217518, A247387.

Programs

Magma

&cat[[41,40,21,11,11,40,41,20,11,10]: n in [0..10]];

Mathematica

CoefficientList[Series [(41 + 40 x + 21 x^2 + 11 x^3 + 11 x^4 + 40 x^5 + 41 x^6 + 20 x^7 + 11 x^8 + 10 x^9)/(1 - x^10), {x, 0, 40}], x]

Formula

G.f.: x^2*(41 + 40*x + 21*x^2 + 11*x^3 + 11*x^4 + 40*x^5 + 41*x^6 + 20*x^7 + 11*x^8 + 10*x^9) / (1-x^10).