login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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. 6
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 (list; graph; refs; listen; history; text; internal format)
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 2 04:53 EST 2021. Contains 341741 sequences. (Running on oeis4.)