|
|
A217517
|
|
Base-n state complexity of partitioned deterministic finite automaton (PDFA) for the periodic sequence (12345)*.
|
|
2
|
|
|
20, 20, 10, 6, 5, 20, 20, 10, 6, 5, 20, 20, 10, 6, 5, 20, 20, 10, 6, 5, 20, 20, 10, 6, 5, 20, 20, 10, 6, 5, 20, 20, 10, 6, 5, 20, 20, 10, 6, 5, 20, 20, 10, 6, 5, 20, 20, 10, 6, 5, 20, 20, 10, 6, 5, 20, 20, 10, 6, 5, 20, 20, 10, 6, 5, 20, 20, 10, 6, 5
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,1
|
|
COMMENTS
|
Ultimately periodic with period length 5.
|
|
LINKS
|
|
|
FORMULA
|
G.f.: x^2*(20 + 20*x + 10*x^2 + 6*x^3 + 5*x^4)/(1 - x^5). - Vincenzo Librandi, Nov 18 2012
|
|
MATHEMATICA
|
CoefficientList[Series[(20 + 20 x + 10 x^2 + 6 x^3 + 5 x^4)/(1 - x^5), {x, 0, 30}], x] (* Vincenzo Librandi, Nov 18 2012 *)
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|