This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A278516 #7 Nov 29 2016 22:39:44 %S A278516 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 A278516 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 A278516 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 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)). %C A278516 Naturally, all terms must be > 0 and <= 4. %H A278516 Antti Karttunen, <a href="/A278516/b278516.txt">Table of n, a(n) for n = 0..10028</a> %F A278516 a(n) = A278216(A276573(n)). %o A278516 (Scheme) (define (A278516 n) (A278216 (A276573 n))) %Y A278516 Cf. A002828, A276573, A278216, A278518. %K A278516 nonn %O A278516 0,1 %A A278516 _Antti Karttunen_, Nov 28 2016