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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A220365 a(n) is conjectured to be the largest power k for which k divides the sum of digits of n^k. 1
 1, 70, 486, 35, 10, 90, 805, 5218, 243, 1, 35, 1494, 469004, 1045, 288, 116, 7, 195, 29, 70, 16710, 23, 2, 1017, 28, 58, 162, 166, 209, 486, 205, 106, 1206, 2053, 37120 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS a(36) >= 423378. Please consult the argument in A067863 for the reason that it is believed that all individual such sequences (all k's which divide b^k) terminate. LINKS FORMULA If a(n) = k, then a(10*n) = k. EXAMPLE a(2) = 70 since the sum of digits of 2^70 is divisible by 70 and it is believed that there does not exist any larger exponent which satisfies this criterion. MATHEMATICA For any individual base, b, fQ[n_] := Mod[Plus @@ IntegerDigits[b^n], n] == 0; k = 1; lst = {}; While[k < 100001, If[ fQ@ k, AppendTo[lst, k]; Print[k]]; k++]; lst CROSSREFS Numbers n such that n divides the sum of digits of k^n: A175169 (k=2), A067862 (k=3), A067864 (k=6), A067863 (k=7), A062933 (k=8), A062927 (k=9), A175525 (k=13), A175589 (k=21), A220364 (k=36), A175552 (k=167). Sequence in context: A157369 A163434 A154085 * A007330 A060541 A235302 Adjacent sequences: A220362 A220363 A220364 * A220366 A220367 A220368 KEYWORD base,nonn AUTHOR Robert G. Wilson v, Dec 12 2012 EXTENSIONS Definition and example corrected by Giovanni Resta, Dec 14 2012 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.

Last modified December 4 21:40 EST 2022. Contains 358570 sequences. (Running on oeis4.)