login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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, 2, 4, 8, 16, 32, 273, 65569, 4294967361, 15177100720513508366558296147058741458143803430094840009779784451085189728165691939 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..10.

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

Sequence in context: A138814 A233424 * A272698 A036373 A119610 A121485

Adjacent sequences:  A137178 A137179 A137180 * A137182 A137183 A137184

KEYWORD

nonn

AUTHOR

Chris Okasaki (cokasaki(AT)acm.org), Apr 04 2008

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 21 06:42 EDT 2019. Contains 322310 sequences. (Running on oeis4.)