A217515 - OEIS

A217515

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

6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6, 4, 3, 6

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

OFFSET

2,1

LINKS

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

Klaus Sutner and Sam Tetruashvili, Inferring automatic sequences.

Index entries for linear recurrences with constant coefficients, signature (0,0,1).

FORMULA

Periodic with period length 3.

G.f.: x^2*(6 + 4*x + 3*x^2)/((1 - x^3)). - Vincenzo Librandi, Nov 18 2012

MATHEMATICA

CoefficientList[Series[(6 + 4*x + 3*x^2)/((1 - x^3)), {x, 0, 40}], x] (* Vincenzo Librandi, Nov 18 2012 *)