A369244 - OEIS

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

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

Other ways to Give

A369244

a(n) is the greatest integer k whose arithmetic derivative is equal to the n-th partial sum of primorials, and 0 if no such k exists.

3

0, 14, 74, 198, 10295, 65174, 40354813, 20485574, 680909375411, 0, 17866904665985941, 318745032938881

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

OFFSET

1,2

COMMENTS

a(n) = the largest integer k for which A003415(k) = A143293(n), and 0 if no such k exists.

LINKS

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

Antti Karttunen, PARI program for computing terms of this and related sequences.

FORMULA

a(n) >= A369243(n).

CROSSREFS

Cf. A003415, A143293, A369243.

Cf. also A368704.

Sequence in context: A328735 A279447 A205590 * A213284 A232377 A146563

Adjacent sequences: A369241 A369242 A369243 * A369245 A369246 A369247

KEYWORD

nonn,hard,more

AUTHOR

Antti Karttunen, Jan 19 2024

STATUS

approved