The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A363743 a(n) = floor(sqrt(log_10(n!))). 0
0, 0, 0, 0, 1, 1, 1, 1, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,9
COMMENTS
Every nonnegative integer occurs at least 4 times.
Each integer k > 14 appears fewer than k times.
The only integers k that occur exactly k times are 11, 13 and 14.
LINKS
FORMULA
a(n) = floor(sqrt(A034886(n) - 1)).
a(n) = A000196(A034886(n) - 1).
MATHEMATICA
Array[Floor@ Sqrt[Log10[#!]] &, 93, 0]
PROG
(PARI) a(n) = sqrtint(log(n!)/log(10)); \\ Michel Marcus, Sep 27 2023
CROSSREFS
Sequence in context: A059396 A108602 A305025 * A085290 A108611 A133875
KEYWORD
nonn
AUTHOR
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified June 10 01:53 EDT 2024. Contains 373251 sequences. (Running on oeis4.)