A094266 - cp's OEIS frontend

A094266 LQTL Lean Quaternary Temporal Logic: a terse form of temporal logic created by assigning four descriptors such that false, becoming true, true and becoming false are represented and become a linear sequence. In a branching tree two alternative are open, change or no change. The integer sequence above is the count of the row possibilities of the four states over successive iterations.

n	a(n)
0	1
1	1
2	0
3	0
4	1
5	2
6	1
7	0
8	1
9	3
10	3
11	1
12	2
13	4
14	6
15	4
16	6
17	6
18	10
19	10
20	16
21	12
22	16
23	20
24	36
25	28
26	28
27	36
28	72
29	64
30	56
31	64
32	136
33	136
34	120
35	120
36	256
37	272
38	256
39	240
40	496
41	528
42	528
43	496
44	992
45	1024
46	1056
47	1024
48	2016
49	2016
50	2080
51	2080
52	4096
53	4032
54	4096
55	4160
56	8256
57	8128
58	8128
59	8256
60	16512

[1, 1, 0, 0, 1, 2, 1, 0, 1, 3, 3, 1, 2, 4, 6, 4, 6, 6, 10, 10, 16, 12, 16, 20, 36, 28, 28, 36, 72, 64, 56, 64, 136, 136, 120, 120, 256, 272, 256, 240, 496, 528, 528, 496, 992, 1024, 1056, 1024, 2016, 2016, 2080, 2080, 4096, 4032, 4096, 4160, 8256, 8128, 8128, 8256, 16512]

cp's OEIS Frontend

Table of values

List of values