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

21, 42, 21, 42, 14, 8, 7, 21, 42, 21, 42, 14, 8, 7, 21, 42, 21, 42, 14, 8, 7, 21, 42, 21, 42, 14, 8, 7, 21, 42, 21, 42, 14, 8, 7, 21, 42, 21, 42, 14, 8, 7, 21, 42, 21, 42, 14, 8, 7, 21, 42, 21, 42, 14, 8, 7, 21, 42, 21, 42, 14, 8, 7, 21, 42, 21, 42, 14, 8, 7

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).
• Index entries for linear recurrences with constant coefficients, signature (0,0,0,0,0,0,1).

Crossrefs

Cf. A176059, A217515, A217516, A217517, A217518.

Programs

Magma

&cat[[21, 42, 21, 42, 14, 8,7]: n in [0..30]];

Mathematica

CoefficientList[Series[(21 + 42 x + 21 x^2 + 42 x^3 + 14 x^4 + 8 x^5 + 7 x^6)/(1 - x^7), {x, 0, 40}], x]

Formula

G.f.: x^2*(21 + 42*x + 21*x^2 + 42*x^3 + 14*x^4 + 8*x^5 + 7*x^6)/(1-x^7).