login
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)
4
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, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6
OFFSET
1,2
COMMENTS
a(1)=1, after which each term n occurs A219661(n-1) times.
Auxiliary function for computing A219666, A230431 and A230432.
LINKS
FORMULA
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]
PROG
(Scheme with Antti Karttunen's intseq-library)
(define A230411 (LEAST-GTE-I 1 1 A219665))
CROSSREFS
Analogous sequence for binary system: A213711.
Sequence in context: A348182 A029133 A255402 * A358551 A358372 A029128
KEYWORD
nonn
AUTHOR
Antti Karttunen, Oct 22 2013
STATUS
approved