|
| |
|
|
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; 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).
|
|
|
EXAMPLE
| Next term after 160 is 160*3 =480.
|
|
|
MATHEMATICA
| NestList[# IntegerLength[#]&, 10, 20] (* From Harvey P. Dale, Feb. 4, 2011 *)
|
|
|
CROSSREFS
| Sequence in context: A114931 A013978 A053162 * A048063 A007927 A160517
Adjacent sequences: A110801 A110802 A110803 * A110805 A110806 A110807
|
|
|
KEYWORD
| base,easy,nonn
|
|
|
AUTHOR
| Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Aug 14 2005
|
|
|
EXTENSIONS
| More terms from Harvey P. Dale, Feb. 4, 2011
|
| |
|
|
