A368906 a(n) is the number of integers k in the range 0..n such that A342001(A005940(1+k)) is not divisible by p^p for any prime p.

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 9, 9, 10, 11, 12, 12, 13, 14, 15, 15, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 24, 25, 26, 27, 28, 28, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 45, 46, 47, 48, 49, 49, 49, 50, 51, 52, 53, 54, 54, 54, 55, 56, 57, 58, 58, 59, 60, 61, 61, 62, 62, 63, 63, 64

Offset

0,3

Links

Antti Karttunen, Table of n, a(n) for n = 0..65537

Formula

a(0) = 0, and for n > 0, a(n) = a(n-1) + A368905(n).

Prog

(PARI)
\\ Needs also program from A366801:
up_to = 65537;
A359550(n) = { my(f = factor(n)); prod(k=1, #f~, (f[k, 2]<f[k, 1])); };
A368905(n) = if(!n, 0, A359550(A366801(n)));
A368906list(up_to) = { my(v=vector(up_to), s=A368905(0)); for(i=1, up_to, s +=
A368905(i); v[i] = s); (v); };
v368906 = A368906list(up_to);
A368906(n) = if(!n, 0, v368906[n]);

Crossrefs

Partial sums of A368905.

Cf. A003415, A048103, A342001, A359550.

Cf. also A368918.

Sequence in context: A329623 A285762 A185137 * A368993 A137180 A258632

Adjacent sequences: A368903 A368904 A368905 * A368907 A368908 A368909

Keyword

nonn

Author

Antti Karttunen, Jan 11 2024

Status

approved