|
Search: id:A036991
|
|
|
| A036991 |
|
Numbers n with the property that in the binary expansion of n, reading from right to left, the number of 0's never exceeds the number of 1's. |
|
+0
6
|
|
| 1, 3, 5, 7, 11, 13, 15, 19, 21, 23, 27, 29, 31, 39, 43, 45, 47, 51, 53, 55, 59, 61, 63, 71, 75, 77, 79, 83, 85, 87, 91, 93, 95, 103, 107, 109, 111, 115, 117, 119, 123, 125, 127, 143, 151, 155, 157, 159, 167, 171, 173, 175, 179, 181, 183, 187, 189, 191, 199, 203
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Nov 27, 2004, comment from Joerg Arndt (arndt(AT)jjj.de): List of binary words that correspond to a valid pairing of parentheses.
|
|
LINKS
|
Joerg Arndt, fxtbook
|
|
EXAMPLE
|
List of binary words with parentheses for those in the sequence:
0 0000 P [empty string]
1 0001 P ()
2 0010
3 0011 P (())
4 0100
5 0101 P ()()
6 0110
7 0111 P ((()))
8 1000
9 1001
10 1010
11 1011 P (()())
12 1100
13 1101 P ()(())
14 1110
15 1111 P (((())))
|
|
CROSSREFS
|
Cf. A036988, A036990, A036992.
Sequence in context: A005239 A141107 A047484 this_sequence A100549 A091892 A117203
Adjacent sequences: A036988 A036989 A036990 this_sequence A036992 A036993 A036994
|
|
KEYWORD
|
nonn,easy,base
|
|
AUTHOR
|
njas
|
|
EXTENSIONS
|
More terms from Erich Friedman (erich.friedman(AT)stetson.edu).
|
|
|
Search completed in 0.002 seconds
|
