A247566 Base-5 state complexity of partitioned deterministic finite automaton (PDFA) for the periodic sequence (123...n)*.

2, 6, 4, 6, 12, 42, 16, 54, 11, 55, 24, 52, 84, 31, 64, 272, 108, 171, 21

Offset

2,1

Links

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

Klaus Sutner and Sam Tetruashvili, Inferring automatic sequences (see table on the p. 5).

Crossrefs

Cf. base-k state complexity of partitioned deterministic finite automaton (PDFA) for the periodic sequence (12...n)*: A217519 (k=2), A217520 (k=3), A217521 (k=4), this sequence (k=5), A247567 (k=6), A247568 (k=7), A247569 (k=8), A247570 (k=9), A247571 (k=10), A247572 (k=11), A247573 (k=12), A247574 (k=13), A247575 (k=14), A247576 (k=15), A247577 (k=16), A247578 (k=17), A247579 (k=18), A247580 (k=19), A247581 (k=20).

Sequence in context: A127399 A240751 A212283 * A151689 A216833 A242046

Adjacent sequences: A247563 A247564 A247565 * A247567 A247568 A247569

Keyword

nonn,more

Author

Vincenzo Librandi, Sep 20 2014

Status

approved