This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A275478 Least k such that d(n) divides d(n+2^k) (d = A000005). 0
 0, 0, 1, 3, 0, 1, 0, 1, 4, 2, 0, 3, 0, 0, 7, 5, 0, 1, 0, 3, 0, 1, 0, 4, 7, 0, 3, 2, 0, 8, 0, 6, 0, 0, 2, 6, 0, 0, 0, 1, 0, 7, 0, 0, 23, 3, 0, 5, 0, 1, 2, 3, 0, 1, 0, 5, 0, 1, 0, 9, 0, 2, 9, 7, 0, 2, 0, 2, 0, 3, 0, 7, 0, 2, 0, 3, 0, 5, 0, 5 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,4 LINKS FORMULA a(A057922(n)) = 0. - Michel Marcus, Aug 01 2016 EXAMPLE a(45) = 23 because A000005(45) = 6 divides A000005(45+2^23) = 18. PROG (PARI) a(n) = {my(k = 0); while(numdiv(n+2^k) % numdiv(n) != 0, k++); k; } CROSSREFS Cf. A000005, A057922. Sequence in context: A316896 A230626 A183700 * A248678 A232630 A216600 Adjacent sequences:  A275475 A275476 A275477 * A275479 A275480 A275481 KEYWORD nonn AUTHOR Altug Alkan, Jul 29 2016 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.

Last modified May 21 19:18 EDT 2019. Contains 323444 sequences. (Running on oeis4.)