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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A076090 a(1) = 1; for n > 1, smallest number > 1 which is the n-th power of the sum of its digits, or 0 if no such number exists. 3
1, 81, 512, 2401, 17210368, 34012224, 612220032, 20047612231936, 3904305912313344, 13744803133596058624, 8007313507497959524352, 2518170116818978404827136, 81920000000000000 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

REFERENCES

Amarnath Murthy, The largest and the smallest m-th power whose digits sum /product is its m-th root. To appear in Smarandache Notions Journal.

Amarnath Murthy, e-book, " Ideas on Smarandache Notions " MS.LIT

LINKS

Table of n, a(n) for n=1..13.

FORMULA

For n > 1, a(n) = A046017(n)^n. - David Wasserman, Mar 25 2005

a(n)=A072408(n), n>1. [From R. J. Mathar, Sep 23 2008]

EXAMPLE

a(3) = 512 = 8^3 and no smaller number (>1) can have this property. (This has been established in the reference.)

CROSSREFS

Cf. A046017.

Sequence in context: A235527 A297122 A128912 * A183428 A236663 A236645

Adjacent sequences:  A076087 A076088 A076089 * A076091 A076092 A076093

KEYWORD

nonn,base

AUTHOR

Amarnath Murthy, Oct 07 2002

EXTENSIONS

More terms from David Wasserman, Mar 25 2005

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 24 23:43 EDT 2022. Contains 356951 sequences. (Running on oeis4.)