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 A231724 #8 Aug 05 2014 09:19:22 %S A231724 0,0,1,0,0,1,3,2,0,0,1,3,2,1,1,3,3,2,2,1,3,4,4,3,4,5,6,0,0,1,3,2,1,1, %T A231724 3,3,2,2,1,3,4,4,3,4,5,7,4,4,5,1,3,3,2,2,1,3,4,4,3,4,5,7,5,7,7,5,6,6, %U A231724 1,3,4,4,3,4,5,7,5,7,7,5,6,6,2,2,3,4,5 %N A231724 a(n) = the difference between the n-th node of the infinite trunk of the factorial beanstalk (A219666(n)) and the greatest integer (A219655(n)) which is as many A219651-iteration steps distanced from the root (zero); a(n) = A219655(n) - A219666(n). %C A231724 For all n, the following holds: A219653(n) <= A219666(n) <= A219655(n). This sequence gives the distance of the node n in the infinite trunk of factorial beanstalk (A219666(n)) from the right (greater) edge of the A219654(n) wide window which it at that point must pass through. %C A231724 This sequence relates to the factorial base representation (A007623) in the same way as A218604 relates to the binary system and similar remarks apply here. %H A231724 Antti Karttunen, <a href="/A231724/b231724.txt">Table of n, a(n) for n = 0..3149</a> %F A231724 a(n) = A219655(n) - A219666(n). %F A231724 A219654(n) = a(n) + A231723(n) + 1. %o A231724 (Scheme) %o A231724 (define (A231724 n) (- (A219655 n) (A219666 n))) %Y A231724 Cf. A231723, A230409, A219662 & A219663. %K A231724 nonn %O A231724 0,7 %A A231724 _Antti Karttunen_, Nov 13 2013