login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A324645 a(n) = gcd(d(n), A276086(n)), where d(n) gives the number of divisors (A000005). 2
1, 1, 2, 3, 2, 1, 2, 1, 3, 1, 2, 1, 2, 1, 2, 5, 2, 1, 2, 3, 2, 1, 2, 1, 1, 1, 2, 3, 2, 1, 2, 3, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 3, 6, 1, 2, 5, 1, 3, 2, 3, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 6, 7, 2, 1, 2, 3, 2, 1, 2, 1, 2, 1, 6, 3, 2, 1, 2, 5, 5, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 3, 2, 1, 2, 1, 2, 3, 6, 9, 2, 1, 2, 1, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

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

FORMULA

a(n) = gcd(A000005(n), A276086(n)).

PROG

(PARI)

A276086(n) = { my(i=0, m=1, pr=1, nextpr); while((n>0), i=i+1; nextpr = prime(i)*pr; if((n%nextpr), m*=(prime(i)^((n%nextpr)/pr)); n-=(n%nextpr)); pr=nextpr); m; };

A324645(n) = gcd(numdiv(n), A276086(n));

CROSSREFS

Cf. A000005, A009191, A276086, A324644.

Sequence in context: A084311 A026490 A053555 * A124160 A265847 A260342

Adjacent sequences:  A324642 A324643 A324644 * A324646 A324647 A324648

KEYWORD

nonn

AUTHOR

Antti Karttunen, Mar 11 2019

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 21 13:54 EST 2020. Contains 331113 sequences. (Running on oeis4.)