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 A230406 #9 Nov 12 2013 12:43:34 %S A230406 0,1,1,3,2,3,2,5,6,2,3,2,5,5,6,2,4,5,6,7,4,5,6,7,5,5,7,10,2,3,2,5,5,6, %T A230406 2,4,5,6,7,4,5,6,7,5,5,6,9,8,7,10,2,4,5,6,7,4,5,6,7,5,5,6,8,6,8,8,7, %U A230406 10,11,4,5,6,7,5,5,6,8,6,8,8,7,10,12,10,11 %N A230406 a(n) = A034968(A219666(n)); after zero, the differences between successive nodes in the infinite trunk of the factorial beanstalk (A219666). %C A230406 Also the first differences of A219666, shifted once right and prepended with zero. %C A230406 This sequence relates to the factorial base representation (A007623) in the same way as A213712 relates to the binary system. %H A230406 Antti Karttunen, <a href="/A230406/b230406.txt">Table of n, a(n) for n = 0..3149</a> %F A230406 a(n) = A034968(A219666(n)). %F A230406 a(0) = 0, and for n>=1, a(n) = A219666(n) - A219666(n-1). %F A230406 a(A226061(n)) = A000217(n-1) for all n. %o A230406 (Scheme) %o A230406 (define (A230406 n) (A034968 (A219666 n))) %o A230406 ;; Alternative definition: %o A230406 (define (A230406 n) (if (zero? n) n (- (A219666 n) (A219666 (- n 1))))) %Y A230406 Cf. also A230418, A230410. %K A230406 nonn %O A230406 0,4 %A A230406 _Antti Karttunen_, Nov 09 2013