A247576 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A247576

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

1

2, 4, 8, 6, 7, 7, 16, 19, 11, 55, 25, 156, 14, 16, 32, 136, 34, 342, 41

(list; graph; refs; listen; history; text; internal format)

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. similar sequences listed in A247566.

Sequence in context: A300813 A086354 A014257 * A339133 A246821 A212885

Adjacent sequences: A247573 A247574 A247575 * A247577 A247578 A247579

KEYWORD

nonn,more

AUTHOR

Vincenzo Librandi, Sep 20 2014

STATUS

approved