login
A247387
Base-n state complexity of partitioned deterministic finite automaton (PDFA) for the periodic sequence (1234567)*.
14
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
Klaus Sutner and Sam Tetruashvili, Inferring automatic sequences (see table on the p. 5).
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
KEYWORD
nonn,easy
AUTHOR
Vincenzo Librandi, Sep 16 2014
STATUS
approved