The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A110804 a(1) = 10, a(n) = a(n-1) times the number of digits in a(n-1). 0
 10, 20, 40, 80, 160, 480, 1440, 5760, 23040, 115200, 691200, 4147200, 29030400, 232243200, 2090188800, 20901888000, 229920768000, 2759049216000, 35867639808000, 502146957312000, 7532204359680000 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS For every n there is a least number k such that n! divides a(m) for all m > k. Subsidiary sequence: least k such that n! divides a(k). LINKS EXAMPLE Next term after 160 is 160*3 = 480. MATHEMATICA NestList[# IntegerLength[#] &, 10, 20] (* Harvey P. Dale, Feb 04 2011 *) CROSSREFS Sequence in context: A013978 A241608 A053162 * A048063 A007927 A284991 Adjacent sequences:  A110801 A110802 A110803 * A110805 A110806 A110807 KEYWORD base,easy,nonn AUTHOR Amarnath Murthy, Aug 14 2005 EXTENSIONS More terms from Harvey P. Dale, Feb 04 2011 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.

Last modified June 16 13:05 EDT 2021. Contains 345057 sequences. (Running on oeis4.)