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 A230418 #15 Nov 21 2013 05:18:08 %S A230418 0,1,2,3,3,3,4,4,5,5,5,6,6,7,7,7,7,7,8,8,8,8,8,8,9,9,10,10,10,11,11, %T A230418 12,12,12,12,12,13,13,13,13,13,14,14,14,14,14,14,15,15,16,16,16,16,17, %U A230418 17,17,17,17,18,18,18,18,18,18,19,19,19,19,19,19,19,20,20 %N A230418 a(n) = the least k such that after having climbed k steps up from the root of the infinite trunk of the factorial beanstalk we have reached integer which is at least n. %C A230418 a(n) = the least k such that A219666(k) >= n. %C A230418 After zero, each n occurs A230406(n) times. %C A230418 The characteristic function of A219666 is given by Χ_A219666(n) = a(n+1)-a(n). %H A230418 Antti Karttunen, <a href="/A230418/b230418.txt">Table of n, a(n) for n = 0..5039</a> %o A230418 (Scheme with _Antti Karttunen_'s Intseq-library) %o A230418 (define A230418 (LEAST-GTE-I 0 0 A219666)) %Y A230418 This sequence relates to the factorial base representation (A007623) in the same way as A213718 relates to the binary system. %K A230418 nonn %O A230418 0,3 %A A230418 _Antti Karttunen_, Nov 09 2013