A275479 - OEIS

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

A275479

Least positive k such that d(n) divides d(n+k) (d = A000005).

2

1, 1, 2, 5, 1, 2, 1, 2, 3, 4, 1, 6, 1, 1, 6, 32, 1, 2, 1, 8, 1, 2, 1, 6, 3, 1, 3, 4, 1, 10, 1, 12, 1, 1, 3, 64, 1, 1, 1, 2, 1, 12, 1, 1, 5, 5, 1, 32, 1, 2, 3, 8, 1, 2, 1, 10, 1, 2, 1, 12, 1, 3, 5, 128, 1, 4, 1, 4, 1, 8, 1, 12, 1, 3, 1, 8, 1, 10, 1, 32, 31, 2, 1, 6, 1, 1, 1, 14, 1, 6, 2, 4, 1, 1, 1, 12, 1, 1, 9, 80

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,3

COMMENTS

a(A057922(n)) = 1. - Michel Marcus, Aug 01 2016

LINKS

Antti Karttunen, Table of n, a(n) for n = 1..20000

EXAMPLE

a(10) = 4 because A000005(10) divides A000005(10+4).

PROG

(PARI) a(n) = {my(k = 1); while(numdiv(n+k) % numdiv(n) != 0, k++); k; }

CROSSREFS

Cf. A000005, A057922, A171937, A275478.

Sequence in context: A189824 A197814 A091772 * A075790 A240543 A004575

Adjacent sequences: A275476 A275477 A275478 * A275480 A275481 A275482

KEYWORD

nonn

AUTHOR

Altug Alkan, Jul 29 2016

EXTENSIONS

Data section extended up to a(100) by Antti Karttunen, Mar 02 2023

STATUS

approved