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 A255058 #15 Feb 21 2015 15:36:40 %S A255058 3,3,1,4,2,1,4,1,3,2,1,4,3,4,1,3,1,3,2,1,4,3,4,1,3,3,1,3,3,4,1,3,1,3, %T A255058 2,1,4,3,4,1,3,3,2,4,4,1,3,3,1,3,3,4,1,3,3,1,3,3,4,1,3,1,3,2,1,4,3,4, %U A255058 1,3,3,2,4,4,1,3,3,2,4,4,1,1,2,3,4,1,3,3,1,3,3,4,1,3,3,2,4,4,1,3,3,1,3,3,4,1,3,3,1,3,3,4,1,3,1,3,2,1,4 %N A255058 Branching degree of node n in the trunk of number-of-runs beanstalk: a(n) = A106836(1+A255057(n)). %C A255058 Iff a(n) = 1, then A255330(n) = 0. %C A255058 If a(n) = 1, then A255331(n) = 0. %H A255058 Antti Karttunen, <a href="/A255058/b255058.txt">Table of n, a(n) for n = 0..8590</a> %F A255058 a(n) = A106836(1+A255057(n)). %e A255058 The node 11 in the infinite trunk is A255056(11) = 30. Apart from 32, which is the next node (node 12) in the infinite trunk, it has one leaf-child 31 at the "left side" (less than 32), and one leaf-child 33 (more than 32) at the "right side", and also at that side a subtree of three nodes (34 <- 38 <- 43), starting from 34, so in total there are four branches emanating from 30, [i.e., four different k such that A236840(k) = 30], thus a(11) = 4. %e A255058 Note that a(0) = 3, as for node zero, we count among its children the following cases A236840(2) = 0, A236840(1) = 0, and also A236840(0) = 0, with 0 being exceptionally its own child. %o A255058 (Scheme) (define (A255058 n) (A106836 (+ 1 (A255057 n)))) %Y A255058 Cf. A005811, A106836, A236840, A255330, A255331, A255056, A255057. %K A255058 nonn %O A255058 0,1 %A A255058 _Antti Karttunen_, Feb 20 2015