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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A329036 Number of common divisors of n and A122111(n). 3
1, 2, 1, 1, 1, 4, 1, 1, 3, 2, 1, 2, 1, 2, 2, 1, 1, 2, 1, 6, 2, 2, 1, 2, 1, 2, 1, 3, 1, 8, 1, 1, 2, 2, 1, 2, 1, 2, 2, 3, 1, 4, 1, 3, 2, 2, 1, 2, 1, 2, 2, 3, 1, 1, 1, 8, 2, 2, 1, 4, 1, 2, 1, 1, 1, 4, 1, 3, 2, 4, 1, 2, 1, 2, 6, 3, 1, 4, 1, 3, 1, 2, 1, 12, 1, 2, 2, 4, 1, 4, 1, 3, 2, 2, 1, 2, 1, 1, 1, 1, 1, 4, 1, 4, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

Index entries for sequences computed from indices in prime factorization

FORMULA

a(n) = A000005(A280491(n)) = A000005(gcd(n, A122111(n))).

a(n) = 1+A001222(A329042(n)) = 1+A001222(A329043(n)).

PROG

(PARI)

A064989(n) = {my(f); f = factor(n); if((n>1 && f[1, 1]==2), f[1, 2] = 0); for (i=1, #f~, f[i, 1] = precprime(f[i, 1]-1)); factorback(f)};

A122111(n) = if(1==n, n, prime(bigomega(n))*A122111(A064989(n)));

A280491(n) = gcd(n, A122111(n));

A329036(n) = numdiv(A280491(n));

CROSSREFS

Cf. A000005, A001222, A122111, A280491, A329042, A329043.

Sequence in context: A174726 A300239 A299203 * A205552 A255707 A260757

Adjacent sequences:  A329033 A329034 A329035 * A329037 A329038 A329039

KEYWORD

nonn

AUTHOR

Antti Karttunen, Nov 08 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 February 23 06:13 EST 2020. Contains 332159 sequences. (Running on oeis4.)