login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A066022
Number of digits in n^n.
9
1, 1, 2, 3, 4, 5, 6, 8, 9, 11, 12, 13, 15, 17, 18, 20, 21, 23, 25, 27, 28, 30, 32, 34, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 88, 90, 92, 94, 96, 98, 101, 103, 105, 107, 109, 112, 114, 116, 118, 121, 123, 125
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
FORMULA
a(n) = A055642(A000312(n)). - Michel Marcus, Dec 05 2019
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