A258198 a(n) = largest k for which A001563(k) = k*k! <= n.

0, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4

Offset: 0

Author

Antti Karttunen, May 23 2015

Keywords

• nonn

Comments

Number of nonzero terms of A001563 <= n.

Each n occurs A001564(n) times.

Links

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

Crossrefs

Cf. A001563, A001564, A084556, A084557, A256450, A258199.

Programs

Scheme

(define (A258198 n) (let loop ((k 1) (f 1)) (if (> (* k f) n) (- k 1) (loop (+ k 1) (* (+ k 1) f)))))