The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A106487 Number of leaves in combinatorial game trees. 3
 1, 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4, 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5, 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 3, 4, 4, 5, 4, 5, 5, 6, 4, 5, 5, 6, 5, 6, 6, 7, 3, 4, 4, 5, 4, 5 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,4 COMMENTS See the comment at A106486. LINKS EXAMPLE 3 = 2^0 + 2^1 = 2^(2*0) + 2^((2*0)+1) encodes the CGT tree \/ which has two terminal nodes, thus a(3)=2. 64 = 2^6 = 2^(2*3), i.e. it encodes the CGT tree \/ .\ which also has two terminal (non-root) nodes, so a(64)=2. PROG (Scheme:) (define (A106487 n) (cond ((zero? n) 1) (else (apply + (map A106487 (map shr (on-bit-indices n))))))) (define (shr n) (if (odd? n) (/ (- n 1) 2) (/ n 2))) (define (on-bit-indices n) (let loop ((n n) (i 0) (c (list))) (cond ((zero? n) (reverse! c)) ((odd? n) (loop (/ (- n 1) 2) (1+ i) (cons i c))) (else (loop (/ n 2) (1+ i) c))))) CROSSREFS Cf. After n=0 differs from A000120 for the first time at n=64, where A000120(64)=1, while a(64)=2. Sequence in context: A105164 A000120 A105062 * A105102 A105105 A178677 Adjacent sequences:  A106484 A106485 A106486 * A106488 A106489 A106490 KEYWORD nonn AUTHOR Antti Karttunen, May 21 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.

Last modified April 9 20:46 EDT 2020. Contains 333363 sequences. (Running on oeis4.)