The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A138908 a(n) = d^d, where d is the number of digits in n. 3
 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,11 LINKS Table of n, a(n) for n=0..120. FORMULA From Amiram Eldar, Nov 18 2020: (Start) a(n) = A055642(n)^A055642(n). Sum_{n>=1} 1/a(n) = A308314. (End) MATHEMATICA dd[n_]:=Module[{d=IntegerLength[n]}, d^d]; Join[{1}, Array[dd, 150]] (* Harvey P. Dale, Mar 16 2013 *) PROG (PARI) a(n) = my(d=#Str(n)); d^d; \\ Michel Marcus, Nov 18 2020 CROSSREFS Cf. A055642, A138902, A308314. Sequence in context: A251539 A123932 A010709 * A032564 A141248 A273339 Adjacent sequences: A138905 A138906 A138907 * A138909 A138910 A138911 KEYWORD easy,nonn,base AUTHOR Odimar Fabeny, May 16 2008 EXTENSIONS Edited by N. J. A. Sloane, Sep 29 2011, at the suggestion of Franklin T. Adams-Watters STATUS approved

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.

Last modified April 17 02:36 EDT 2024. Contains 371756 sequences. (Running on oeis4.)