id:A036988 - OEIS Search Results

Search: id:A036988

Displaying 1-1 of 1 results found.

page 1

Has simplest possible tree complexity of all transcendental sequences.

+0
5

1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1 (list; graph; listen)

	OFFSET	`0,1`
	REFERENCES	`H. Niederreiter and M. Vielhaber, Tree complexity and a doubly ..., J. Complexity, 12 (1996), 187-198.`
	FORMULA	`a(n) = 1 iff, in the binary expansion of n, reading from right to left, the number of 1's never exceeds the number of 0's.`
	CROSSREFS	`Cf. A036989. Characteristic function of A036990.` `Sequence in context: A014069 A029694 A085405 this_sequence A108357 A088517 A040053` `Adjacent sequences: A036985 A036986 A036987 this_sequence A036989 A036990 A036991`
	KEYWORD	`nonn,easy,nice`
	AUTHOR	`njas`
	EXTENSIONS	`More terms from Larry Reeves (larryr(AT)acm.org), Sep 25 2000`

page 1

Search completed in 0.002 seconds

Last modified July 25 02:12 EDT 2008. Contains 142294 sequences.

AT&T Labs Research