|
| |
|
|
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.
|
|
5
|
|
|
|
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
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
0,6
|
|
|
LINKS
|
Table of n, a(n) for n=0..60.
|
|
|
FORMULA
|
Appears to satisfy a 12-degree linear recurrence. - Ralf Stephan, Dec 04 2004
|
|
|
MAPLE
|
Algorithm available from bbarbour(AT)unitec.ac.nz
|
|
|
CROSSREFS
|
Cf. A000749, A005418, A038503, A038504, A038505, A020522, A063376.
Sequence in context: A167763 A127839 A017827 * A071569 A118340 A213276
Adjacent sequences: A094263 A094264 A094265 * A094267 A094268 A094269
|
|
|
KEYWORD
|
easy,nonn
|
|
|
AUTHOR
|
R. H. Barbour and L. D. Painter (bbarbour(AT)unitec.ac.nz), Jun 01 2004
|
|
|
STATUS
|
approved
|
| |
|
|
