The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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)). 3
 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 (list; graph; refs; listen; history; text; internal format)
 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 * A292434 A138522 A095813 Adjacent sequences:  A278513 A278514 A278515 * A278517 A278518 A278519 KEYWORD nonn AUTHOR Antti Karttunen, Nov 28 2016 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 17 04:44 EST 2021. Contains 340214 sequences. (Running on oeis4.)