A363836 - OEIS

More Web Proxy on the site http://driver.im/

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

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