login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A138908 a(n) = d^d, where d is the number of digits in n. 2
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.

MATHEMATICA

dd[n_]:=Module[{d=IntegerLength[n]}, d^d]; Join[{1}, Array[dd, 150]] (* Harvey P. Dale, Mar 16 2013 *)

CROSSREFS

Cf. A138902.

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 | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified November 21 05:01 EST 2017. Contains 294988 sequences.