A317948 - cp's OEIS frontend

A317948 An example of a morphic word: the sorted (by length, then alphabetically) sequence of words of the form ab under the action of a finite automaton defined as follows: start state is 0; a and b map states [0, 1, 2, 3] to states [1, 2, 3, 0] and [0, 3, 1, 2], respectively.

n	a(n)
1	0
2	1
3	0
4	2
5	3
6	0
7	3
8	1
9	2
10	0
11	0
12	2
13	3
14	1
15	0
16	1
17	0
18	1
19	2
20	3
21	0
22	2
23	3
24	0
25	3
26	1
27	2
28	0
29	3
30	1
31	2
32	0
33	2
34	3
35	1
36	0
37	0
38	2
39	3
40	1
41	0
42	1
43	2
44	3
45	0
46	1
47	0
48	1
49	2
50	3
51	0
52	3
53	1
54	2
55	0
56	2
57	3
58	0
59	3
60	1
61	2
62	0
63	2
64	3
65	1
66	0
67	3
68	1
69	2
70	0
71	2
72	3
73	1
74	0
75	1
76	2
77	3
78	0
79	0
80	2
81	3
82	1
83	0
84	1
85	2
86	3
87	0

[0, 1, 0, 2, 3, 0, 3, 1, 2, 0, 0, 2, 3, 1, 0, 1, 0, 1, 2, 3, 0, 2, 3, 0, 3, 1, 2, 0, 3, 1, 2, 0, 2, 3, 1, 0, 0, 2, 3, 1, 0, 1, 2, 3, 0, 1, 0, 1, 2, 3, 0, 3, 1, 2, 0, 2, 3, 0, 3, 1, 2, 0, 2, 3, 1, 0, 3, 1, 2, 0, 2, 3, 1, 0, 1, 2, 3, 0, 0, 2, 3, 1, 0, 1, 2, 3, 0]

cp's OEIS Frontend

A317948 An example of a morphic word: the sorted (by length, then alphabetically) sequence of words of the form ab under the action of a finite automaton defined as follows: start state is 0; a and b map states [0, 1, 2, 3] to states [1, 2, 3, 0] and [0, 3, 1, 2], respectively.

Table of values

List of values

n	a(n)
1	0
2	1
3	0
4	2
5	3
6	0
7	3
8	1
9	2
10	0
11	0
12	2
13	3
14	1
15	0
16	1
17	0
18	1
19	2
20	3
21	0
22	2
23	3
24	0
25	3
26	1
27	2
28	0
29	3
30	1
31	2
32	0
33	2
34	3
35	1
36	0
37	0
38	2
39	3
40	1
41	0
42	1
43	2
44	3
45	0
46	1
47	0
48	1
49	2
50	3
51	0
52	3
53	1
54	2
55	0
56	2
57	3
58	0
59	3
60	1
61	2
62	0
63	2
64	3
65	1
66	0
67	3
68	1
69	2
70	0
71	2
72	3
73	1
74	0
75	1
76	2
77	3
78	0
79	0
80	2
81	3
82	1
83	0
84	1
85	2
86	3
87	0

n	a(n)
1	0
2	1
3	0
4	2
5	3
6	0
7	3
8	1
9	2
10	0
11	0
12	2
13	3
14	1
15	0
16	1
17	0
18	1
19	2
20	3
21	0
22	2
23	3
24	0
25	3
26	1
27	2
28	0
29	3
30	1
31	2
32	0
33	2
34	3
35	1
36	0
37	0
38	2
39	3
40	1
41	0
42	1
43	2
44	3
45	0
46	1
47	0
48	1
49	2
50	3
51	0
52	3
53	1
54	2
55	0
56	2
57	3
58	0
59	3
60	1
61	2
62	0
63	2
64	3
65	1
66	0
67	3
68	1
69	2
70	0
71	2
72	3
73	1
74	0
75	1
76	2
77	3
78	0
79	0
80	2
81	3
82	1
83	0
84	1
85	2
86	3
87	0

cp's OEIS Frontend

A317948 An example of a morphic word: the sorted (by length, then alphabetically) sequence of words of the form a*b* under the action of a finite automaton defined as follows: start state is 0; a and b map states [0, 1, 2, 3] to states [1, 2, 3, 0] and [0, 3, 1, 2], respectively.

Table of values

List of values

A317948 An example of a morphic word: the sorted (by length, then alphabetically) sequence of words of the form ab under the action of a finite automaton defined as follows: start state is 0; a and b map states [0, 1, 2, 3] to states [1, 2, 3, 0] and [0, 3, 1, 2], respectively.

n	a(n)
1	0
2	1
3	0
4	2
5	3
6	0
7	3
8	1
9	2
10	0
11	0
12	2
13	3
14	1
15	0
16	1
17	0
18	1
19	2
20	3
21	0
22	2
23	3
24	0
25	3
26	1
27	2
28	0
29	3
30	1
31	2
32	0
33	2
34	3
35	1
36	0
37	0
38	2
39	3
40	1
41	0
42	1
43	2
44	3
45	0
46	1
47	0
48	1
49	2
50	3
51	0
52	3
53	1
54	2
55	0
56	2
57	3
58	0
59	3
60	1
61	2
62	0
63	2
64	3
65	1
66	0
67	3
68	1
69	2
70	0
71	2
72	3
73	1
74	0
75	1
76	2
77	3
78	0
79	0
80	2
81	3
82	1
83	0
84	1
85	2
86	3
87	0