OFFSET
1,3
COMMENTS
This is almost certainly the same as the number of decimal digits of the sum of the n-th powers of the divisors of n (a sequence submitted by Labos Elemer on Jan 14 2002). Although no formal proof for this is known, Jon E. Schoenfield has verified it for n up to 10^8 and has given a plausible heuristic argument that it is true for all n.
LINKS
Harry J. Smith, Table of n, a(n) for n=1..1000
FORMULA
MAPLE
[seq(length(n^n), n=1..55)]; # Zerinvary Lajos, Mar 10 2007
MATHEMATICA
Table[IntegerLength[n^n], {n, 80}] (* Vincenzo Librandi, Mar 08 2015 *)
PROG
(PARI) a(n)=#digits(n^n); \\ Joerg Arndt, Apr 30 2020
(Magma) [ #Intseq(n^n): n in [1..80] ]; // Vincenzo Librandi, Mar 08 2015
CROSSREFS
KEYWORD
base,easy,nonn
AUTHOR
Robert A. Stump (bee_ess107(AT)yahoo.com), Dec 11 2001
EXTENSIONS
Edited by N. J. A. Sloane Jan 03 2009 at the suggestion of Jon E. Schoenfield.
STATUS
approved