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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A106457 Number of edges in each rooted plane tree produced with the GF(2)[X] factorization unranking algorithm presented in A106456. 5
0, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 5, 4, 4, 3, 4, 5, 6, 5, 4, 5, 6, 4, 7, 6, 5, 5, 5, 5, 8, 4, 9, 5, 6, 6, 9, 7, 6, 5, 10, 5, 8, 6, 5, 7, 11, 5, 5, 8, 5, 7, 7, 6, 12, 5, 7, 6, 13, 6, 14, 9, 5, 4, 6, 10, 15, 6, 5, 7, 15, 6, 16, 10, 7, 8, 14, 7, 8, 6, 6, 11, 6, 6, 5, 9, 17, 6, 13, 6, 18, 8, 9, 12 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

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

LINKS

Table of n, a(n) for n=1..94.

A. Karttunen, Scheme-program for computing this sequence.

CROSSREFS

a(n) = A075167(A106443(n)). Permutation of A072643.

Sequence in context: A146323 A071626 A182008 * A103128 A156080 A271058

Adjacent sequences:  A106454 A106455 A106456 * A106458 A106459 A106460

KEYWORD

nonn

AUTHOR

Antti Karttunen, May 09 2005

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 23 17:32 EDT 2019. Contains 328373 sequences. (Running on oeis4.)