login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A217518 Base-n state complexity of partitioned deterministic finite automaton (PDFA) for the periodic sequence (123456)*. 15
13, 7, 7, 12, 7, 6, 13, 7, 7, 12, 7, 6, 13, 7, 7, 12, 7, 6, 13, 7, 7, 12, 7, 6, 13, 7, 7, 12, 7, 6, 13, 7, 7, 12, 7, 6, 13, 7, 7, 12, 7, 6, 13, 7, 7, 12, 7, 6, 13, 7, 7, 12, 7, 6, 13, 7, 7, 12, 7, 6, 13, 7, 7, 12, 7, 6, 13, 7, 7, 12, 7, 6, 13 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,1

LINKS

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

Klaus Sutner and Sam Tetruashvili, Inferring automatic sequences

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

FORMULA

Periodic with period length 6.

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

MATHEMATICA

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

LinearRecurrence[{0, 0, 0, 0, 0, 1}, {13, 7, 7, 12, 7, 6}, 80] (* or *) PadRight[ {}, 80, {13, 7, 7, 12, 7, 6}] (* Harvey P. Dale, Jul 19 2016 *)

PROG

(MAGMA) &cat[[13, 7, 7, 12, 7, 6]: n in [0..30]]; // Vincenzo Librandi, Nov 18 2012

(PARI) a(n)=[7, 6, 13, 7, 7, 12][n%6+1] \\ Charles R Greathouse IV, Nov 18 2012

CROSSREFS

Sequence in context: A324279 A222464 A095389 * A257928 A206611 A298257

Adjacent sequences:  A217515 A217516 A217517 * A217519 A217520 A217521

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane, Oct 07 2012

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 23 16:46 EDT 2019. Contains 328373 sequences. (Running on oeis4.)