A063171 - OEIS

This site is supported by donations to The OEIS Foundation.

A063171

Dyck language interpreted as binary numbers in ascending order.

118

10, 1010, 1100, 101010, 101100, 110010, 110100, 111000, 10101010, 10101100, 10110010, 10110100, 10111000, 11001010, 11001100, 11010010, 11010100, 11011000, 11100010, 11100100, 11101000, 11110000, 1010101010, 1010101100 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,1`
	COMMENTS	Replacing "1" by "(" and "0" by ")" yields well-formed bracket expressions (), ()(), (()), ()()(), ()(()), (())(), (()()), ((())), ()()()(), ()()(()), ()(())(), ()(()()), ()((())), (())()(), (())(()), (()())(), (()()()), (()(())), ((()))(), ((())()), ((()())), (((()))), ()()()()(), ()()()(()), ()()(())(), ()()(()()), ()()((())), ()(())()(), ()(())(()), ()(()())(), ()(()()()), ()(()(())), ()((()))(), ()((())()), ()((()())), ()(((()))), (())()()(), (())()(()), (())(())(), (())(()()), (())((())), (()())()(), (()())(()), (()()())(), (()()()()), (()()(())), (()(()))(), (()(())()), (()(()())), (()((()))), ((()))()(), ((()))(()), ((())())(), ((())()()), ((())(())), ((()()))(), ((()())()), ((()()())), ((()(()))), (((())))(), (((()))()), (((())())), (((()()))), ((((()))))
	LINKS	`A. Karttunen, Illustration of initial terms up to size n=7` `A. Karttunen, Catalan Automorphisms`
	FORMULA	`Chomsky-2 grammar with axiom s, terminal alphabet {0, 1} and three rules s -> ss, s -> 1s0, s ->10`
	EXAMPLE	`s -> ss -> 1s0s -> 11s00s -> 111000s -> 11100010`
	CROSSREFS	`a(n) = A071152(n)/2. A014486 gives these terms as converted from decimal to binary system. Cf. also A071153.` `Sequence in context: A104486 A098753 A066489 * A075166 A071671 A075171` `Adjacent sequences: A063168 A063169 A063170 * A063172 A063173 A063174`
	KEYWORD	`base,nonn`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 09 2001`

Content is available under The OEIS End-User License Agreement .

Last modified February 17 02:08 EST 2012. Contains 205978 sequences.