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 A230411 #14 Jun 02 2025 08:43:17 %S A230411 1,2,3,3,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,5,6,6,6,6,6,6, %T A230411 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6, %U A230411 6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6,6 %N A230411 a(n) = minimal k for which A219665(k) >= n; a(n) = one more than the factorial base width (A084558) of the (n-1)th term in the infinite trunk of factorial beanstalk (A219666). %C A230411 a(1)=1, after which each term n occurs A219661(n-1) times. %C A230411 Auxiliary function for computing A219666, A230431 and A230432. %H A230411 Antti Karttunen, <a href="/A230411/b230411.txt">Table of n, a(n) for n = 1..5000</a> %F A230411 a(n) = 1 + A084558(A219666(n-1)) = 1 + A084558(A230416(n-1)). [Each a(n) is one more than the number of digits needed in factorial base to write the (n-1)-th term in the infinite trunk of factorial beanstalk] %o A230411 (Scheme with _Antti Karttunen_'s intseq-library) %o A230411 (define A230411 (LEAST-GTE-I 1 1 A219665)) %Y A230411 Cf. A219661, A219665, A219666, A230431, A230432. %Y A230411 Analogous sequence for binary system: A213711. %K A230411 nonn %O A230411 1,2 %A A230411 _Antti Karttunen_, Oct 22 2013