login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A038178 n = (sum of digits of n)^(number of digits of n). 2
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 81, 512, 2401 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,3

COMMENTS

Subset of A023106. - R. J. Mathar, Oct 20 2008

LINKS

Table of n, a(n) for n=0..12.

FORMULA

a(n) = (1/10)*(n-(n mod 10))*(729*n^2-14879*n+75971)+(n mod 10). - Rolf Pleisch, Feb 06 2008

EXAMPLE

n=512 is in the sequence because (5 + 1 + 2)^3 = 512.

MATHEMATICA

Select[Range[2500], #==Total[IntegerDigits[#]]^IntegerLength[#]&] (* Harvey P. Dale, Oct 26 2011 *)

CROSSREFS

Sequence in context: A237346 A193757 A246605 * A023106 A135480 A289979

Adjacent sequences:  A038175 A038176 A038177 * A038179 A038180 A038181

KEYWORD

nonn,nice,fini,full,base

AUTHOR

Felice Russo

EXTENSIONS

To prove completeness, consider that k^m contains more than m digits for every k >= 10 and check 1<=k<=9 explicitly. - Ulrich Schimke (ulrschimke(AT)aol.com)

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 30 16:16 EDT 2020. Contains 333127 sequences. (Running on oeis4.)