login
The OEIS is supported by the many generous donors to the OEIS Foundation.
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A363836
a(n) = smallest number m such that digitsum(m^n) < digitsum(m), or -1 if no such m exists.
1
39, 587, 124499
(list; graph; refs; listen; history; text; internal format)
OFFSET
2,1
COMMENTS
a(n) > 0 when n is even (see MSE link).
a(5) > 10^12 or a(5) = -1. - Max Alekseyev, Jan 26 2024
LINKS
Table of n, a(n) for n=2..4.
Jeppe Stig Nielsen et al., Integers n for which the digit sum of n exceeds the digit sum of n^5, Math StackExchange, 2015.
EXAMPLE
a(2) = A064399(1).
a(3) = A064209(1).
a(4) = A261439(1).
CROSSREFS
Cf. A007953, A064399, A064209, A122484, A261439, A292832.
Sequence in context: A077454 A142976 A200409 * A341565 A034187 A059609
Adjacent sequences: A363833 A363834 A363835 * A363837 A363838 A363839
KEYWORD
nonn,base,bref,hard,more
AUTHOR
Max Alekseyev, Oct 19 2023
STATUS
approved

Lookup Welcome Wiki Register Music Plot 2 Demos Index WebCam Contribute Format Style Sheet Transforms Superseeker Recents
The OEIS Community
Maintained by The OEIS Foundation Inc.
Last modified November 16 23:21 EST 2024. Contains 377807 sequences.
License Agreements, Terms of Use, Privacy Policy