id:A106457 - OEIS Search Results

Search: id:A106457

Displaying 1-1 of 1 results found.

page 1

Number of edges in each rooted plane tree produced with the GF(2)[X] factorization unranking algorithm presented in A106456.

+0
6

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; listen)

	OFFSET	`1,3`
	COMMENT	`Also the digital length of A106456(n)/2. Each value v occurs A000108(v) times.`
	LINKS	`A. Karttunen, Scheme-program for computing this sequence.`
	CROSSREFS	`a(n) = A075167(A106443(n)). Permutation of A072643.` `Sequence in context: A061555 A146323 A071626 this_sequence A103128 A156080 A107320` `Adjacent sequences: A106454 A106455 A106456 this_sequence A106458 A106459 A106460`
	KEYWORD	`nonn`
	AUTHOR	`Antti Karttunen (His-Firstname.His-Surname(AT)iki.fi), May 09 2005`

page 1

Search completed in 0.002 seconds

Last modified November 27 22:38 EST 2009. Contains 167602 sequences.

AT&T Labs Research