|
Search: id:A137181
|
|
|
| A137181 |
|
Maximal number of symbols in terms generated by an inefficient set of rewrite rules for flattening combinator expressions of initial size n. |
|
+0
1
|
|
| 1, 2, 4, 8, 16, 32, 273, 65569, 4294967361, 15177100720513508366558296147058741458143803430094840009779784451085189728165691\ 939
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
C. Okasaki, A Spectacular Failure
|
|
FORMULA
|
a(n) = 2^(n-1), for n <= 6; a(n) = 2^a(n-3) + 2*a(n-3) + 1, for n > 6
|
|
EXAMPLE
|
For n=6, the maximum result is generated from the initial term X (X (X (X (X X)))). For n=10, the maximum result is generated from the initial term X (X X) (X (X X) (X (X (X X)))).
|
|
CROSSREFS
|
Adjacent sequences: A137178 A137179 A137180 this_sequence A137182 A137183 A137184
Sequence in context: A035523 A078227 A138814 this_sequence A036373 A119610 A121485
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Chris Okasaki (cokasaki(AT)acm.org), Apr 04 2008
|
|
|
Search completed in 0.002 seconds
|
