login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..100.

FORMULA

a(n) = minimal positive integer k such that n^k does not belong to A005349.

For m>=0, a(10^m) = 0.

CROSSREFS

Cf. A135186, A135187, A135188, A135189, A135190, A135191, A135192, A135193, A135194, A135195, A135196, A135197, A135198, A135199, A135200, A135201, A135202.

Sequence in context: A214549 A154892 A286155 * A106143 A255524 A077158

Adjacent sequences:  A195857 A195858 A195859 * A195861 A195862 A195863

KEYWORD

nonn,base

AUTHOR

Max Alekseyev, Sep 24 2011

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 18 15:08 EDT 2021. Contains 343089 sequences. (Running on oeis4.)