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

A369972
Numbers k such that (prime(k)#)' is a multiple of prime(1+k), where prime(k)# means the k-th primorial, A002110(k), and ' stands for taking the arithmetic derivative, A003415.
4
0, 2, 7, 14, 21, 28, 261202
OFFSET
1,2
COMMENTS
Numbers k for which A024451(k) is a multiple of A000040(1+k).
FORMULA
a(n) = A000720(A293457(n)) - 1.
EXAMPLE
7 is included because the primorial prime(7)# = A002110(7) = 510510 has as its arithmetic derivative 510510' = A024451(7) = 716167 = 19*37693, which is divisible by the next larger prime not present in the primorial, in this case by prime(8) = 19.
PROG
(PARI)
A024451(n) = numerator(sum(i=1, n, 1/prime(i)));
isA369972(n) = !(A024451(n)%prime(1+n));
CROSSREFS
Cf. A000040, A000720, A024451, A293457 (corresponding primes), A369970, A369973 (corresponding primorials).
Cf. also A109628.
Sequence in context: A263398 A161702 A114346 * A325159 A087324 A340664
KEYWORD
nonn,more,hard
AUTHOR
Antti Karttunen, Feb 07 2024
EXTENSIONS
Found a(7) by computing it as A000720(A293457(7))-1. - Antti Karttunen, Feb 08 2024
STATUS
approved