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

 

Logo


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

%I

%S 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,

%T 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,

%U 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

%N 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)).

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

%H Antti Karttunen, <a href="/A278516/b278516.txt">Table of n, a(n) for n = 0..10028</a>

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

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

%Y Cf. A002828, A276573, A278216, A278518.

%K nonn

%O 0,1

%A _Antti Karttunen_, Nov 28 2016

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 5 11:27 EST 2021. Contains 341823 sequences. (Running on oeis4.)