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,1

Links

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

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

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

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]

Prog

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

Crossrefs

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

Sequence in context: A067344 A053428 A123842 * A362849 A120772 A260749

Adjacent sequences: A247384 A247385 A247386 * A247388 A247389 A247390

Keyword

nonn,easy

Author

Vincenzo Librandi, Sep 16 2014

Status

approved