A345952 a(n) = 1 if the largest prime power divisor of n (A034699) is greater than the largest prime divisor of n (A006530).

0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1

Offset

1

Links

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

Index entries for characteristic functions

Formula

a(n) = 1 if A034699(n) > A006530(n), 0 otherwise.

a(n) >= A268340(n), for all n >= 1.

a(n) >= A345951(n), for all n >= 1.

Prog

(PARI) A345952(n) = { my(f=factor(n), k=#f[, 1]); for(i=1, k, if(f[i, 1]^f[i, 2]>f[k, 1], return(1))); (0); }; \\ After program given in A122145.

Crossrefs

Characteristic function of A122145.

Cf. A006530, A034699, A268340, A345951.

Sequence in context: A060039 A319710 A345951 * A359466 A359467 A359469

Adjacent sequences: A345949 A345950 A345951 * A345953 A345954 A345955

Keyword

nonn

Author

Antti Karttunen, Jul 04 2021

Status

approved