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!)
A258198 a(n) = largest k for which A001563(k) = k*k! <= n. 7
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,5

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

PROG

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

CROSSREFS

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

Sequence in context: A130635 A107609 A243113 * A204562 A135660 A163858

Adjacent sequences:  A258195 A258196 A258197 * A258199 A258200 A258201

KEYWORD

nonn

AUTHOR

Antti Karttunen, May 23 2015

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 September 24 06:13 EDT 2021. Contains 347623 sequences. (Running on oeis4.)