OFFSET
0,9
COMMENTS
The edge-relation between nodes is given by A236840(child) = parent. a(n) = 1 + the size of transitive closure of all children emanating from the parent at n. For any n in A255056 this would be infinite, thus such n are marked with zeros.
Odd numbers are leaves, as there are no such k that A236840(k) were odd, thus a(2n+1) = 1.
LINKS
Antti Karttunen, Table of n, a(n) for n = 0..8590
FORMULA
PROG
(Scheme, with memoization-macro definec)
(definec (A255327 n) (cond ((odd? n) 1) ((= 1 (A255339 (/ n 2))) 0) (else (+ 1 (add A255327 (A091067 (/ n 2)) (A255068 (/ n 2)))))))
;; Auxiliary function add implements sum_{i=lowlim..uplim} intfun(i)
(define (add intfun lowlim uplim) (let sumloop ((i lowlim) (res 0)) (cond ((> i uplim) res) (else (sumloop (1+ i) (+ res (intfun i)))))))
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, Feb 21 2015
STATUS
approved