|
|
A217520
|
|
Base-3 state complexity of partitioned deterministic finite automaton (PDFA) for the periodic sequence (123...n)*.
|
|
4
|
|
|
2, 4, 8, 20, 7, 42, 16, 13, 40, 55, 25, 39, 84, 61, 64, 272, 22, 342, 80, 127, 110, 253, 49, 500, 78, 40, 168, 812, 121, 930, 256, 166, 544, 420, 76, 666, 684, 118, 160, 328, 253, 1806, 440, 184, 506, 1081, 193, 2058, 1000, 817, 312, 2756, 67
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,1
|
|
COMMENTS
|
Also the number of distinct words that can be formed from (123..n)* by taking every 3^k-th term from some initial index i, with i and k nonnegative. (Follows from Case 2 of Theorem 2.1) - Charlie Neder, Feb 28 2019
|
|
LINKS
|
|
|
FORMULA
|
a(3^k) = ((3^(k+1)-1)/2. It appears that a(n) <= n(n-1), with equality if and only if n is a prime with primitive root 3 (A019334). - Charlie Neder, Feb 28 2019
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
a(11)-a(20) added (see Inferring Automatic Sequences) by Vincenzo Librandi, Nov 18 2012
|
|
STATUS
|
approved
|
|
|
|