

A262900


a(n) = number of leafchildren n has in the tree generated by edgerelation A049820(child) = parent.


3



0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 2, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 2, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 2, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 1, 2, 0, 0, 1, 0, 0, 0, 1, 1, 1, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,23


COMMENTS

a(n) = number of such terms k in A045765 for which k  d(k) = n [where d(k) is the number of divisors of k, A000005(k)].


LINKS

Antti Karttunen, Table of n, a(n) for n = 0..65538


FORMULA

a(n) = Sum_{k = A082284(n) .. A262686(n)} [A049820(k) = n] * [A060990(k) = 0].
In the above formula [ ] stands for Iverson bracket, giving in the first instance as its result 1 only when A049820(k) = n (that is, when k is really a child of n), and 0 otherwise, and in the second instance 1 only when A060990(k) = 0 (that is, when k itself has no children), and 0 otherwise.  Comment corrected by Antti Karttunen, Nov 27 2015


EXAMPLE

a(4) = 1, as there is only one such term k in A045765 which satisfies the condition A049820(k) = 4, namely 8 (8  d(8) = 4).
a(5) = 1, as the only term in A045765 satisfying the condition is 7, as 7  d(7) = 5.
a(22) = 2, as there are exactly two terms in A045765 satisfying the condition, namely 25 and 28, as 25  d(25) = 28  d(28) = 22.


PROG

(Scheme)
(define (A262900 n) (let loop ((s 0) (k (A262686 n))) (cond ((<= k n) s) ((= n (A049820 k)) (loop (+ s (if (zero? (A060990 k)) 1 0)) ( k 1))) (else (loop s ( k 1))))))


CROSSREFS

Cf. A000005, A045765, A049820, A060990, A082284, A262686.
Cf. A262901 (indices of nonzero terms), A262902.
Sequence in context: A239434 A033770 A216283 * A242830 A101668 A141846
Adjacent sequences: A262897 A262898 A262899 * A262901 A262902 A262903


KEYWORD

nonn


AUTHOR

Antti Karttunen, Oct 06 2015


STATUS

approved



