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!)
A243293 Number of factorials < 10^n. 1
3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 14, 15, 16, 17, 18, 18, 19, 20, 21, 21, 22, 23, 24, 24, 25, 26, 26, 27, 28, 29, 29, 30, 31, 31, 32, 33, 33, 34, 34, 35, 36, 36, 37, 38, 38, 39, 40, 40, 41, 41, 42, 43, 43, 44, 44, 45, 46, 46, 47, 47, 48, 49, 49, 50, 50, 51, 52, 52, 53, 53 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
A181590(150) = 95 does not agree with a(150) = 96.
0! and 1! are the same number so a(n) counts it as 1 number.
a(n) is also the number of terms needed in the series Sum_{k=0..m} 1/k! to calculate exp(1) with a precision of at least n - 1 digits, i.e., exp(1) - Sum_{k=0..a(n)}1/k! < 10^(-n). - Martin Renner, Feb 18 2020
LINKS
EXAMPLE
There are 4 factorials < 10^2: 0! = 1! = 1, 2! = 2, 3! = 6, and 4! = 24. Thus a(2) = 4.
MATHEMATICA
f=1; t=0; n=10; L={}; While[Length[L] < 100, t++; f*=t; While[f > n, AppendTo[ L, t-1]; n *= 10]]; L (* Giovanni Resta, Feb 19 2020 *)
PROG
(PARI) a(n) = {my(tot=0); for(k=1, 10^n, if(k!<10^n, tot++); if(k!>=10^n, break)); return(tot)}
n=1; while(n<100, print1(a(n), ", "); n++)
CROSSREFS
Sequence in context: A260158 A317093 A181590 * A078923 A165240 A350398
KEYWORD
nonn
AUTHOR
Derek Orr, Jun 02 2014
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 May 11 14:55 EDT 2024. Contains 372409 sequences. (Running on oeis4.)