|
|
A082543
|
|
Take a string of n x's and insert n-1 ^'s and n-1 pairs of parentheses in all possible ways. Sequence gives number of distinct integer values when x=sqrt(2).
|
|
1
|
|
|
|
OFFSET
|
1,5
|
|
COMMENTS
|
It appears that the integer values obtained are always of form 2^(2^k).
|
|
LINKS
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|