id:A075172 - OEIS Search Results

Search: id:A075172

Displaying 1-1 of 1 results found.

page 1

Number of edges in each rooted plane tree produced with the binary run length unranking algorithm presented in A075171.

+0
3

0, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 3, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 5, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7 (list; graph; listen)

	OFFSET	`0,3`
	COMMENT	`Also the digital length of A075171(n)/ 2. Each value v occurs A000108(v) times.`
	CROSSREFS	`Permutation of A072643.` `Sequence in context: A072768 A071673 A072660 this_sequence A029837 A070939 A113473` `Adjacent sequences: A075169 A075170 A075171 this_sequence A075173 A075174 A075175`
	KEYWORD	`nonn`
	AUTHOR	`Antti Karttunen Sep 13 2002`

page 1

Search completed in 0.002 seconds

Last modified July 24 12:00 EDT 2008. Contains 142294 sequences.

AT&T Labs Research