login
A247435
Base-n state complexity of partitioned deterministic finite automaton (PDFA) for the periodic sequence (123....13)*
0
156, 39, 78, 52, 156, 156, 52, 39, 78, 156, 26, 14, 13, 156, 39, 78, 52, 156, 156, 52, 39, 78, 156, 26, 14, 13, 156, 39, 78, 52, 156, 156, 52, 39, 78, 156, 26, 14, 13, 156, 39, 78, 52, 156, 156, 52, 39, 78, 156, 26, 14, 13, 156, 39, 78, 52, 156, 156, 52, 39
OFFSET
2,1
LINKS
Klaus Sutner and Sam Tetruashvili, Inferring automatic sequences (see table on the p. 5).
FORMULA
G.f.: x^2*(156 + 39*x + 78*x^2 + 52*x^3 + 156*x^4 + 156*x^5 + 52*x^6 + 39*x^7 + 78*x^8 + 156*x^9 + 26*x^10 + 14*x^11 + 13*x^12)/(1 - x^13).
MATHEMATICA
CoefficientList[Series[(156 + 39 x + 78 x^2 + 52 x^3 + 156 x^4 + 156 x^5 + 52 x^6 + 39 x^7 + 78 x^8 + 156 x^9 + 26 x^10 + 14 x^11 + 13 x^12)/(1 - x^13), {x, 0, 60}], x]
PadRight[{}, 120, {156, 39, 78, 52, 156, 156, 52, 39, 78, 156, 26, 14, 13}] (* Harvey P. Dale, Mar 19 2021 *)
PROG
(Magma) &cat[[156, 39, 78, 52, 156, 156, 52, 39, 78, 156, 26, 14, 13]: n in [0..10]];
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
Vincenzo Librandi, Sep 19 2014
STATUS
approved