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!)
A331287 a(n) = gcd(n, A225546(n)). 7
1, 2, 1, 1, 1, 2, 1, 2, 9, 2, 1, 12, 1, 2, 1, 1, 1, 18, 1, 4, 1, 2, 1, 24, 1, 2, 9, 4, 1, 2, 1, 2, 1, 2, 1, 9, 1, 2, 1, 8, 1, 2, 1, 4, 9, 2, 1, 4, 1, 2, 1, 4, 1, 18, 1, 8, 1, 2, 1, 12, 1, 2, 9, 1, 1, 2, 1, 4, 1, 2, 1, 18, 1, 2, 3, 4, 1, 2, 1, 80, 1, 2, 1, 12, 1, 2, 1, 8, 1, 18, 1, 4, 1, 2, 1, 8, 1, 2, 9, 1, 1, 2, 1, 8, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
FORMULA
a(n) = gcd(n, A225546(n)).
a(n) = A331310(n) * A331311(n).
a(A297845(n,9)) = A297845(a(n),9). - Peter Munn, Jan 24 2020
PROG
(PARI) A331287(n) = gcd(n, A225546(n));
(PARI)
A048675(n) = { my(f = factor(n)); sum(k=1, #f~, f[k, 2]*2^primepi(f[k, 1]))/2; };
A331287(n) = if(1==n, 1, my(f=factor(n), u=#binary(vecmax(f[, 2])), prods=vector(u, x, 1), m=1, e); for(i=1, u, if(!(n%prime(i)), for(k=1, #f~, if(bitand(f[k, 2], m), prods[i] *= f[k, 1]))); m<<=1); prod(i=1, u, prime(i)^min(valuation(n, prime(i)), A048675(prods[i]))));
CROSSREFS
Cf. A225546, A225547 (fixed points), A297845, A331288, A331310, A331311.
Sequence in context: A074807 A165194 A002951 * A365105 A093993 A193073
KEYWORD
nonn
AUTHOR
Antti Karttunen, Jan 20 2020
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 May 4 15:13 EDT 2024. Contains 372254 sequences. (Running on oeis4.)