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

Author

Antti Karttunen, Nov 28 2016

Keywords

• nonn

Comments

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

Links

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

Crossrefs

Cf. A002828, A276573, A278216, A278518.

Programs

Scheme

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

Formula

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