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!)
A363836 a(n) = smallest number m such that digitsum(m^n) < digitsum(m), or -1 if no such m exists. 1

%I #20 Feb 01 2024 00:10:09

%S 39,587,124499

%N a(n) = smallest number m such that digitsum(m^n) < digitsum(m), or -1 if no such m exists.

%C a(n) > 0 when n is even (see MSE link).

%C a(5) > 10^12 or a(5) = -1. - _Max Alekseyev_, Jan 26 2024

%H Jeppe Stig Nielsen et al., <a href="https://math.stackexchange.com/q/1401871">Integers n for which the digit sum of n exceeds the digit sum of n^5</a>, Math StackExchange, 2015.

%e a(2) = A064399(1).

%e a(3) = A064209(1).

%e a(4) = A261439(1).

%Y Cf. A007953, A064399, A064209, A122484, A261439, A292832.

%K nonn,base,bref,hard,more

%O 2,1

%A _Max Alekseyev_, Oct 19 2023

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 August 30 15:13 EDT 2024. Contains 375545 sequences. (Running on oeis4.)