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.

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, 12, 12, 12, 12, 12, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 15, 15, 16, 16, 16, 16, 17, 17, 17, 17, 17, 18, 18, 18, 18, 18, 18, 19, 19, 19, 19, 19, 19, 19, 20, 20

Offset

0,3

Comments

a(n) = the least k such that A219666(k) >= n.

After zero, each n occurs A230406(n) times.

The characteristic function of A219666 is given by Χ_A219666(n) = a(n+1)-a(n).

Links

Antti Karttunen, Table of n, a(n) for n = 0..5039

Prog

(Scheme with Antti Karttunen's Intseq-library)
(define A230418 (LEAST-GTE-I 0 0 A219666))

Crossrefs

This sequence relates to the factorial base representation (A007623) in the same way as A213718 relates to the binary system.

Sequence in context: A193832 A293137 A087823 * A037037 A156262 A218447

Adjacent sequences: A230415 A230416 A230417 * A230419 A230420 A230421

Keyword

nonn

Author

Antti Karttunen, Nov 09 2013

Status

approved