

A218786


The sizes of the "tendrils" (finite sidetrees sprouting at A213730, A218787) of infinite beanstalk (A179016).


5



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



OFFSET

1,9


LINKS

Antti Karttunen, Table of n, a(n) for n = 1..8727


FORMULA

a(n) = A213726(A213730(n))1.


EXAMPLE

The first four tendrils of the beanstalk sprout at 2, 5, 6 and 9, (the first four nonzero terms of A213730) which are all leaves (i.e., in A055938), thus the first four terms of this sequence are all 0's. The next term A213730(5)=10, which is not leaf, but branches to two leafbranches (12 and 13, as with both we have: 12A000120(12)=10 and 13A000120(13)=10, and both 12 and 13 are found from A055938, so the tendril at 10 is a binary tree of one internal vertex (and two leaves), i.e., \/, thus a(5)=1.


PROG

(Scheme): (define (A218786 n) (1+ (A213726 (A213730 n))))


CROSSREFS

Equally, a(n) = A072643(A218787(n)) = A072643(A218788(n)). Cf. A218613, A218603, A218604.
Sequence in context: A225099 A174806 A089605 * A218787 A325336 A060016
Adjacent sequences: A218783 A218784 A218785 * A218787 A218788 A218789


KEYWORD

nonn


AUTHOR

Antti Karttunen, Nov 11 2012


STATUS

approved



