Maximal number of symbols in terms generated by an inefficient set of rewrite rules for flattening combinator expressions of initial size n.

A137181

Maximal number of symbols in terms generated by an inefficient set of rewrite rules for flattening combinator expressions of initial size n.

Terms

    a(0) =1a(1) =2a(2) =4a(3) =8a(4) =16a(5) =32a(6) =273a(7) =65569a(8) =4294967361

External references