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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A356299 a(n) = gcd(A276086(n), A342001(n)), where A276086 is the primorial base exp-function, and A342001 is the arithmetic derivative without its inherited divisor. 3
2, 1, 1, 1, 1, 5, 1, 3, 2, 1, 1, 1, 1, 3, 2, 1, 1, 1, 1, 3, 10, 1, 1, 1, 2, 15, 3, 1, 1, 1, 1, 1, 14, 1, 6, 5, 1, 21, 2, 1, 1, 1, 1, 3, 1, 25, 1, 7, 2, 3, 10, 7, 1, 1, 2, 1, 2, 1, 1, 1, 1, 3, 1, 3, 18, 1, 1, 3, 2, 1, 1, 1, 1, 3, 1, 5, 18, 1, 1, 1, 2, 1, 1, 1, 2, 15, 2, 35, 1, 1, 2, 3, 2, 49, 6, 1, 1, 1, 5, 7, 1, 7, 1, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Each term a(n) is a factor of A327858(n).
LINKS
PROG
(PARI)
A003415(n) = if(n<=1, 0, my(f=factor(n)); n*sum(i=1, #f~, f[i, 2]/f[i, 1]));
A003557(n) = (n/factorback(factorint(n)[, 1]));
A276086(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m); };
A342001(n) = (A003415(n) / A003557(n));
A356299(n) = gcd(A276086(n), A342001(n));
CROSSREFS
Cf. A003415, A003557, A046337 (positions of even terms), A276086, A342001, A327858.
Sequence in context: A181937 A233836 A214719 * A327858 A307372 A259681
KEYWORD
nonn
AUTHOR
Antti Karttunen, Nov 03 2022
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 04:02 EDT 2024. Contains 371918 sequences. (Running on oeis4.)