login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A075172 Number of edges in each rooted plane tree produced with the binary run length unranking algorithm presented in A075171. 2
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; refs; listen; history; internal format)
OFFSET

0,3

COMMENTS

Also the digital length of A075171(n)/ 2. Each value v occurs A000108(v) times.

CROSSREFS

Permutation of A072643.

Sequence in context: A071673 A174199 A072660 * A004258 A029837 A070939

Adjacent sequences:  A075169 A075170 A075171 * A075173 A075174 A075175

KEYWORD

nonn

AUTHOR

Antti Karttunen Sep 13 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

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

Last modified February 15 07:42 EST 2012. Contains 205717 sequences.