0,4

See the comment at A106486.

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.

(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)))))

Cf. After n=0 differs from A000120 for the first time at n=64, where A000120(64)=1, while a(64)=2.

Adjacent sequences: A106484 A106485 A106486 this_sequence A106488 A106489 A106490

Sequence in context: A105164 A000120 A105062 this_sequence A105102 A105105 A054717

nonn

Antti Karttunen (His-Firstname.His-Surname(AT)gmail.com), May 21 2005