[go: up one dir, main page]

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

A351234
a(n) = A276085(gcd(A003415(n), A276086(n))).
5
0, 1, 0, 0, 0, 0, 6, 0, 2, 3, 0, 0, 0, 0, 2, 1, 0, 0, 0, 0, 2, 7, 0, 0, 0, 7, 8, 2, 0, 0, 0, 0, 0, 31, 0, 3, 6, 0, 32, 1, 0, 0, 0, 0, 2, 2, 12, 0, 30, 31, 8, 7, 30, 0, 0, 1, 0, 1, 0, 0, 0, 0, 2, 2, 2, 5, 0, 0, 2, 1, 0, 0, 0, 0, 2, 6, 6, 5, 0, 0, 0, 3, 0, 0, 0, 1, 8, 1, 36, 0, 0, 1, 2, 1, 60, 3, 0, 0, 30, 8, 36, 0, 30
OFFSET
0,7
FORMULA
a(n) = A276085(A327858(n) = A276085(gcd(A003415(n), A276086(n))).
a(n) = n - A351233(n).
PROG
(PARI)
A002110(n) = prod(i=1, n, prime(i));
A276085(n) = { my(f = factor(n)); sum(k=1, #f~, f[k, 2]*A002110(primepi(f[k, 1])-1)); };
A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
A327858(n) = gcd(A003415(n), A276086(n));
CROSSREFS
KEYWORD
nonn,base,easy
AUTHOR
Antti Karttunen, Feb 05 2022
STATUS
approved