A351086 - OEIS

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

A351086

a(n) = gcd(A003415(n), A328572(n)), where A003415 is the arithmetic derivative and A328572 converts the primorial base expansion of n into its prime product form, but with 1 subtracted from all nonzero digits.

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 5, 1, 1, 1, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 5, 1, 1, 1, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 5, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 5, 1, 35, 1, 1, 1, 1, 1, 49, 3, 1, 1, 7, 1, 7, 1, 7

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

OFFSET

0,22

LINKS

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

Index entries for sequences related to primorial base

FORMULA

a(n) = gcd(A003415(n), A328572(n)).

a(n) = gcd(A327858(n), A345000(n)).

PROG

(PARI)

A003415(n) = {my(fac); if(n<1, 0, fac=factor(n); sum(i=1, matsize(fac)[1], n*fac[i, 2]/fac[i, 1]))}; \\ From A003415