login

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”).

A195860
Minimal positive integer k such that n^k is not divisible by the sum of its decimal digits; or 0 if no such integer exists.
17
0, 4, 6, 2, 2, 11, 2, 2, 3, 0, 1, 6, 1, 1, 1, 1, 1, 5, 1, 4, 3, 1, 1, 7, 1, 1, 2, 1, 1, 25, 1, 1, 1, 1, 1, 6, 1, 1, 1, 2, 1, 6, 1, 1, 3, 1, 1, 5, 1, 2, 1, 1, 1, 7, 1, 1, 1, 1, 1, 15, 1, 1, 3, 1, 1, 1, 1, 1, 1, 2, 1, 4, 1, 1, 1, 1, 1, 1, 1, 4, 2, 1, 1, 4, 1, 1, 1, 1, 1, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0
OFFSET
1,2
FORMULA
a(n) = minimal positive integer k such that n^k does not belong to A005349.
For m>=0, a(10^m) = 0.
KEYWORD
nonn,base
AUTHOR
Max Alekseyev, Sep 24 2011
STATUS
approved