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!)
A071424 a(n) = a(n-1) + number of decimal digits of n!. Number of decimal digits of concatenation of first n factorials. 0

%I #6 Oct 15 2013 22:31:23

%S 1,2,3,5,8,11,15,20,26,33,41,50,60,71,84,98,113,129,147,166,186,208,

%T 231,255,281,308,337,367,398,431,465,501,538,577,618,660,704,749,796,

%U 844,894,946,999,1054,1111,1169,1229,1291,1354,1419,1486,1554,1624

%N a(n) = a(n-1) + number of decimal digits of n!. Number of decimal digits of concatenation of first n factorials.

%t Do[s=s+Length[IntegerDigits[n! ]]; Print[s], {n, 1, 128}]

%Y Cf. A058183.

%K easy,nonn,base

%O 1,2

%A _Labos Elemer_, May 27 2002

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 April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)