Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A082499
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A082499 Take a string of n x's and insert n-1 ^'s and n-1 pairs of parentheses in all possible legal ways. Sequence gives number of distinct values when x = sqrt(2). +0
2
1, 2, 4, 8, 17, 38, 88, 206, 497 (list; graph; listen)
OFFSET

2,2

COMMENT

For n=9, largest value is x^(x^(x^(x^(x^6)))) and results from the 132-th tree {0,{0,{0,{{{{{{0,0},0},0},0},0},0}}}} or {1,0,1,0,1,0,1,1,1,1,1,1,0,0,0,0,0,0}.

REFERENCES

F. Goebel and R. P. Nederpelt, The number of numerical outcomes of iterated powers, Amer. Math. Monthly, 80 (1971), 1097-1103.

R. K. Guy and J. L. Selfridge, The nesting and roosting habits of the laddered parenthesis. Amer. Math. Monthly 80 (1973), 868-876.

EXAMPLE

For n = 4 there are 5 functions: f1(x) = ((x^x)^x)^x; f2(x) = (x^(x^x))^x; f3(x) = x^((x^x)^x); f4(x) = x^(x^(x^x)); f5(x) = (x^x)^(x^x); but only 4 different values when x = sqrt(2).

CROSSREFS

Cf. A003019, A000081, A002845, A003018, A082543.

Sequence in context: A089796 A112482 A107597 this_sequence A100131 A119685 A025276

Adjacent sequences: A082496 A082497 A082498 this_sequence A082500 A082501 A082502

KEYWORD

nonn

AUTHOR

Edwin Clark (eclark(AT)math.usf.edu) and Meeussen Wouter (wouter.meeussen(AT)pandora.be), Apr 29 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research