id:A126303 - OEIS Search Results

Search: id:A126303

Displaying 1-1 of 1 results found.

page 1

a(n) = number of nodes with odd distance to the root in the n-th plane general tree encoded by A014486(n). Both internal and terminal nodes (leaves) are counted.

+0
3

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

	OFFSET	`0,3`
	EXAMPLE	`A014486(27) = 696 (1010111000 in binary), encodes the following general plane tree, where the root is marked with * and nodes with even or odd distance to root with 'e's and 'o's, respectively.` `.......o` `.......\|` `.......e` `.......\|` `...o.o.o` `....\\|/.` `.....*..` `there are four nodes marked with 'o', thus a(27)=4.`
	PROGRAM	`(MIT Scheme:) (define (A126303 n) (A126303 (A014486->parenthesization (A014486 n))))` `(define (A126303 s) (cond ((null? s) 0) (else (fold-left (lambda (x y) (+ x 1 (*A126304 y))) 0 s))))`
	CROSSREFS	`a(n) = A072643(n)-A126305(n). Cf. A126304. Scheme-function A014486->parenthesization given in A014486.` `Sequence in context: A096857 A090000 A109082 this_sequence A157810 A072339 A038571` `Adjacent sequences: A126300 A126301 A126302 this_sequence A126304 A126305 A126306`
	KEYWORD	`nonn`
	AUTHOR	`Antti Karttunen (His-Firstname.His-Surname(AT)gmail.com), Jan 02 2007`

page 1

Search completed in 0.002 seconds

Last modified December 5 23:38 EST 2009. Contains 170428 sequences.

AT&T Labs Research