A278516 Number of children the n-th node (counted from the root 0) has in the infinite trunk of least squares beanstalk tree: a(n) = A278216(A276573(n)).

4, 4, 1, 3, 3, 2, 2, 2, 1, 4, 3, 2, 2, 4, 1, 1, 3, 1, 3, 3, 1, 3, 3, 3, 1, 2, 1, 2, 2, 1, 3, 3, 1, 3, 1, 1, 2, 4, 2, 1, 1, 1, 3, 1, 4, 3, 2, 2, 2, 1, 1, 2, 2, 2, 3, 1, 2, 3, 2, 2, 2, 1, 3, 3, 1, 2, 3, 2, 1, 1, 2, 4, 2, 2, 3, 1, 2, 1, 3, 3, 1, 3, 3, 1, 1, 1, 2, 3, 1, 3, 2, 3, 1, 3, 1, 1, 3, 2, 2, 3, 1, 2, 2, 1, 3, 3, 2, 2, 1, 1, 2, 1, 1, 3, 3, 2, 1, 4, 2, 1, 3

Offset

0,1

Comments

Naturally, all terms must be > 0 and <= 4.

Links

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

Formula

a(n) = A278216(A276573(n)).

Prog

(Scheme) (define (A278516 n) (A278216 (A276573 n)))

Crossrefs

Cf. A002828, A276573, A278216, A278518.

Sequence in context: A281540 A053216 A325489 * A362329 A292434 A138522

Adjacent sequences: A278513 A278514 A278515 * A278517 A278518 A278519

Keyword

nonn

Author

Antti Karttunen, Nov 28 2016

Status

approved